On the Optimality of Uncoded Cache Placement

November 06, 2015 Β· Declared Dead Β· πŸ› Information Theory Workshop

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Kai Wan, Daniela Tuninetti, Pablo Piantanida arXiv ID 1511.02256 Category cs.IT: Information Theory Citations 223 Venue Information Theory Workshop Last Checked 4 months ago
Abstract
Caching is an efficient way to reduce peak-hour network traffic congestion by storing some contents at user's local cache without knowledge of later demands. Maddah-Ali and Niesen initiated a fundamental study of caching systems; they proposed a scheme (with uncoded cache placement and linear network coding delivery) that is provably optimal to within a factor 12. In this paper, by noticing that when the cache contents and the demands are fixed, the caching problem can be seen as an index coding problem, we show the optimality of Maddah-Ali and Niesen's scheme assuming that cache placement is restricted to be uncoded and the number of users is not less than the number of files. Furthermore, this result states that further improvement to the Maddah-Ali and Niesen's scheme in this regimes can be obtained only by coded cache placement.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted