Decentralized Caching Under Nonuniform File Popularity and Size: Memory-Rate Tradeoff Characterization
Abstract
References
Index Terms
- Decentralized Caching Under Nonuniform File Popularity and Size: Memory-Rate Tradeoff Characterization
Recommendations
Decentralized coded caching attains order-optimal memory-rate tradeoff
Replicating or caching popular content in memories distributed across the network is a technique to reduce peak network loads. Conventionally, the main performance gain of this caching was thought to result from making part of the requested data ...
File popularity characterisation
A key determinant of the effectiveness of a web cache is the locality of the files requested. In the past this has been difficult to model, as locality appears to be cache specific. We show that locality can be characterised with a single parameter, ...
Comments
Information & Contributors
Information
Published In
![cover image IEEE/ACM Transactions on Networking](/cms/asset/f3ac5d58-1e08-4863-95ea-b9fef4d65835/2992189.cover.jpg)
Publisher
IEEE Press
Publication History
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 9Total Downloads
- Downloads (Last 12 months)9
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in