%0 Conference Paper %1 7277426 %A Ramakrishnan, A. %A Westphal, C. %A Markopoulou, A. %B Teletraffic Congress (ITC 27), 2015 27th International %D 2015 %K Electronic_mail Encoding Indexes Internet Internet_traffic Optimization Servers cache_storage cooperative_coded_caching efficient_delivery_scheme expected_load_minimization index_coding_problem itc itc27 load_reduction shared_link telecommunication_links %P 46-54 %R 10.1109/ITC.2015.13 %T An Efficient Delivery Scheme for Coded Caching %U https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc27/7277426.pdf?inline=true %X We consider a network with several users trying to access a database of files stored at a server through a shared link. Each user is equipped with a cache, where files can be prefetched according to a caching policy which is mainly based on the popularities of the files. Coded caching tries to exploit coding opportunities created by cooperative caching and has been shown to significantly reduce the load on the shared link. Most of the prior works focused on optimizing the caching policy so as to minimize this expected load. Given the caching policy and the user demands, the problem of minimizing the load over the shared link is essentially an index coding problem. In this paper, we design a novel delivery scheme that builds on a prior scheme for the uniform demand case, but performs better in the non-uniform demand case. We also evaluate this delivery scheme for different caching policies.

@inproceedings{7277426, abstract = {We consider a network with several users trying to access a database of files stored at a server through a shared link. Each user is equipped with a cache, where files can be prefetched according to a caching policy which is mainly based on the popularities of the files. Coded caching tries to exploit coding opportunities created by cooperative caching and has been shown to significantly reduce the load on the shared link. Most of the prior works focused on optimizing the caching policy so as to minimize this expected load. Given the caching policy and the user demands, the problem of minimizing the load over the shared link is essentially an index coding problem. In this paper, we design a novel delivery scheme that builds on a prior scheme for the uniform demand case, but performs better in the non-uniform demand case. We also evaluate this delivery scheme for different caching policies.}, added-at = {2016-07-11T18:20:14.000+0200}, author = {Ramakrishnan, A. and Westphal, C. and Markopoulou, A.}, biburl = {https://www.bibsonomy.org/bibtex/2b47645b1a4047e1b3a34b9abc775a10e/itc}, booktitle = {Teletraffic Congress (ITC 27), 2015 27th International}, doi = {10.1109/ITC.2015.13}, interhash = {76e30ceb54d2eca5f236072dd4a87e5b}, intrahash = {b47645b1a4047e1b3a34b9abc775a10e}, keywords = {Electronic_mail Encoding Indexes Internet Internet_traffic Optimization Servers cache_storage cooperative_coded_caching efficient_delivery_scheme expected_load_minimization index_coding_problem itc itc27 load_reduction shared_link telecommunication_links}, month = {Sept}, pages = {46-54}, timestamp = {2020-04-30T18:18:14.000+0200}, title = {An Efficient Delivery Scheme for Coded Caching}, url = {https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc27/7277426.pdf?inline=true}, year = 2015 }