Hierarchical coded caching. Karamchandani, N., Niesen, U., Maddah-Ali, M., & Diggavi, S. In Information Theory (ISIT), 2014 IEEE International Symposium on, pages 2142-2146, June, 2014.
Hierarchical coded caching [link]Arxiv  doi  abstract   bibtex   
It has recently been demonstrated that for single-layer cache networks, jointly designing caching and delivery can enable significant benefits over conventional caching. This was based on strategically designing the cached content to induce coded multicasting opportunities even among users with different demands and without foreknowledge of the user demands. In this work, we extend this coded caching approach to a multi-hop hierarchical content delivery network with two layers of caches. We propose a new caching scheme that combines two basic approaches. The first approach provides coded multicasting opportunities within each layer (through decoding and forwarding); the second approach provides coded multicasting opportunities across multiple layers (through strategic forwarding without decoding). By striking the right balance between these two approaches, we show that the proposed scheme achieves the optimal communication rates to within a constant multiplicative and additive gap. We further show that there is no tension between the rates in each of the two layers up to the aforementioned gap. Thus, both layers can simultaneously operate at approximately the minimum rate.
@inproceedings{6875212,
 abstract = {It has recently been demonstrated that for single-layer cache networks, jointly designing caching and delivery can enable significant benefits over conventional caching. This was based on strategically designing the cached content to induce coded multicasting opportunities even among users with different demands and without foreknowledge of the user demands. In this work, we extend this coded caching approach to a multi-hop hierarchical content delivery network with two layers of caches. We propose a new caching scheme that combines two basic approaches. The first approach provides coded multicasting opportunities within each layer (through decoding and forwarding); the second approach provides coded multicasting opportunities across multiple layers (through strategic forwarding without decoding). By striking the right balance between these two approaches, we show that the proposed scheme achieves the optimal communication rates to within a constant multiplicative and additive gap. We further show that there is no tension between the rates in each of the two layers up to the aforementioned gap. Thus, both layers can simultaneously operate at approximately the minimum rate.},
 author = {Karamchandani, N. and Niesen, U. and Maddah-Ali, M.A and Diggavi, S.},
 booktitle = {Information Theory (ISIT), 2014 IEEE International Symposium on},
 doi = {10.1109/ISIT.2014.6875212},
 file = {:papers:hier_caching.pdf},
 month = {June},
 pages = {2142-2146},
 tags = {conf,Caching,IT,WiNet},
 title = {Hierarchical coded caching},
 type = {4},
 url_arxiv = {http://arxiv.org/abs/1403.7007},
 year = {2014}
}

Downloads: 0