Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff
Alcatel Lucent (Germany) · Nokia (United States)
Abstract
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 available closer to end-users. Instead, we recently showed that a much more significant gain can be achieved by using caches to create coded-multicasting opportunities, even for users with different demands, through coding across data streams. These coded-multicasting opportunities are enabled by careful content overlap at the various caches in the network, created by a central coordinating server. In many scenarios, such a central coordinating server may not be…
Citation impact
- FWCI
- 81.30
- Percentile
- 100%
- References
- 20
Authors
2Topics & keywords
- Computer science
- Multicast
- Computer network
- Scheme (mathematics)
- Linear network coding
- Distributed computing
- Coding (social sciences)
- False sharing