| 摘要 |
Caching algorithms estimate the popularity (future request rate or re-use time) and base caching decision on popularity (future request rate or re-use time). Thereby the popularity (future request rate or re-use time) upon which the decisions are made, is not limited to the locally measured one, but a combination of all popularities of all storage means, where the weight of each is determined by social relations between users served by the different storage means. |
