@inproceedings{6874794,
 abstract = {Recent work has demonstrated that, for content caching, joint design of storage and delivery can yield significant benefits over conventional caching approaches. This is based on storing content in the caches in a way that creates coded-multicast opportunities even among users with different demands. Such a coded-caching scheme has been shown to be order-optimal for a caching system with single-level content, i.e., one where all content is uniformly popular. In this work, we consider a system with content divided into multiple levels, based on varying degrees of popularity. The main contribution of this work is the derivation of an information-theoretic outer bound for the multi-level setup, and the demonstration that, under some natural regularity conditions, a memory-sharing scheme, which operates each level in isolation according to a single-level coded caching scheme, is in fact order-optimal with respect to this outer bound.},
 author = {Hachem, J. and Karamchandani, N. and Diggavi, S.},
 booktitle = {Information Theory (ISIT), 2014 IEEE International Symposium on},
 doi = {10.1109/ISIT.2014.6874794},
 month = {June},
 pages = {56-60},
 tags = {conf,Caching,IT,WiNet},
 title = {Multi-level coded caching},
 type = {4},
 url_arxiv = {http://arxiv.org/abs/1404.6563},
 year = {2014}
}

{"_id":"bzMFqQHNbu59p8GDP","bibbaseid":"hachem-karamchandani-diggavi-multilevelcodedcaching-2014","author_short":["Hachem, J.","Karamchandani, N.","Diggavi, S."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"Recent work has demonstrated that, for content caching, joint design of storage and delivery can yield significant benefits over conventional caching approaches. This is based on storing content in the caches in a way that creates coded-multicast opportunities even among users with different demands. Such a coded-caching scheme has been shown to be order-optimal for a caching system with single-level content, i.e., one where all content is uniformly popular. In this work, we consider a system with content divided into multiple levels, based on varying degrees of popularity. The main contribution of this work is the derivation of an information-theoretic outer bound for the multi-level setup, and the demonstration that, under some natural regularity conditions, a memory-sharing scheme, which operates each level in isolation according to a single-level coded caching scheme, is in fact order-optimal with respect to this outer bound.","author":[{"propositions":[],"lastnames":["Hachem"],"firstnames":["J."],"suffixes":[]},{"propositions":[],"lastnames":["Karamchandani"],"firstnames":["N."],"suffixes":[]},{"propositions":[],"lastnames":["Diggavi"],"firstnames":["S."],"suffixes":[]}],"booktitle":"Information Theory (ISIT), 2014 IEEE International Symposium on","doi":"10.1109/ISIT.2014.6874794","month":"June","pages":"56-60","tags":"conf,Caching,IT,WiNet","title":"Multi-level coded caching","url_arxiv":"http://arxiv.org/abs/1404.6563","year":"2014","bibtex":"@inproceedings{6874794,\n abstract = {Recent work has demonstrated that, for content caching, joint design of storage and delivery can yield significant benefits over conventional caching approaches. This is based on storing content in the caches in a way that creates coded-multicast opportunities even among users with different demands. Such a coded-caching scheme has been shown to be order-optimal for a caching system with single-level content, i.e., one where all content is uniformly popular. In this work, we consider a system with content divided into multiple levels, based on varying degrees of popularity. The main contribution of this work is the derivation of an information-theoretic outer bound for the multi-level setup, and the demonstration that, under some natural regularity conditions, a memory-sharing scheme, which operates each level in isolation according to a single-level coded caching scheme, is in fact order-optimal with respect to this outer bound.},\n author = {Hachem, J. and Karamchandani, N. and Diggavi, S.},\n booktitle = {Information Theory (ISIT), 2014 IEEE International Symposium on},\n doi = {10.1109/ISIT.2014.6874794},\n month = {June},\n pages = {56-60},\n tags = {conf,Caching,IT,WiNet},\n title = {Multi-level coded caching},\n type = {4},\n url_arxiv = {http://arxiv.org/abs/1404.6563},\n year = {2014}\n}\n\n","author_short":["Hachem, J.","Karamchandani, N.","Diggavi, S."],"key":"6874794","id":"6874794","bibbaseid":"hachem-karamchandani-diggavi-multilevelcodedcaching-2014","role":"author","urls":{" arxiv":"http://arxiv.org/abs/1404.6563"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib","dataSources":["hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["multi","level","coded","caching","hachem","karamchandani","diggavi"],"title":"Multi-level coded caching","year":2014}