Coded-Caching-Techniques-Survey

This repository contains a Survey for Coded Caching Techniques with resources.

Abstract

With the ever-increasing number of network requests and users on the internet caching has become an indispensable tool to reduce throughput and latency. In traditional caching the user stores some data locally in its cache, referred as the local caching gain. With more and more users and requests, optimising the load at the local side is no longer sufficient. Coded caching on the other hand makes use of the multicasting gain, creating a global caching gain, without cooperation among the users. With optimising both the placement phase and the delivery phase coded caching is able to serve multiple users with different request over fewer messages, reducing the load in the delivery phase dramatically. However with the introduction of coded caching techniques new challenges need to be solved. In this paper, we address the limitations and challenges of coded caching. For this purpose, we identify the three domains. First we compare methods to apply coded caching to real world networks architectures in the domain of mobile and static network structures and the resulting effects on both coding delay and transmission rate. Second we discuss the user specific behaviour and effects on the proposed coding schemes. Finally, we evaluate current privacy methods in coded caching and compare the load to non-private coded caching.

Resources

• A. Meyerson, K. Munagala, and S. Plotkin, “Web caching using access statistics,” Society for Industrial and Applied Mathematics, pp. 354–363, 2001.
• M. A. Maddah-Ali and U. Niesen, “Fundamental Limits of Caching,” IEEE Transactions on Information Theory, vol. 60, no. 5, pp. 2856–2867, 2014.
• S.P.Shariatpanahi,S.A.Motahari,andB.H.Khalaj,“Multi-ServerCoded Caching,” IEEE Transactions on Information Theory, vol. 62, no. 12, pp. 7253– 7271, 2016.
• A. Das, S. Vishwanath, S. Jafar, and A. Markopoulou, “Network coding for multiple unicasts: An interference alignment approach,” IEEE International Symposium on Information Theory, pp. 1878–1882, 2010.
• M. Bayat, K. Wan, and G. Caire, “Coded Caching Over Multicast Routing Networks,” IEEE Transactions on Communications, vol. 69, no. 6, pp. 3614– 3627, 2021.
• E. Parrinello, A. Ünsal, and P. Elia, “Optimal coded caching in heterogeneous networks with uncoded prefetching,” IEEE Information Theory Workshop, pp. 1–5, 2018.
• U. Niesen and M. A. Maddah-Ali, “Coded Caching With Nonuniform Demands,” IEEE Transactions on Information Theory, vol. 63, no. 2, pp. 1146– 1158, 2017.
• R. Pedarsani, M. A. Maddah-Ali, and U. Niesen, “Online Coded Caching,” IEEE/ACM Transactions on Networking, vol. 24, no. 2, pp. 836–845, 2016.
• D. D. Sleator and R. E. Tarjan, “Amortized Efficiency of List Update and Paging Rules,” Communications of the ACM, vol. 28, no. 2, pp. 202–208, 1985.
• M. Ji, A. Tulino, J. Llorca, and G. Caire, “Caching-Aided Coded Multicasting with Multiple Random Requests,” IEEE Information Theory Workshop, pp. 1–5, 2015.
• A. Sengupta, R. Tandon, and T. C. Clancy, “Fundamental Limits of Caching with Secure Delivery,” IEEE Transactions on Information Forensics and Security, vol. 10, no. 2, pp. 355–370, 2015.
• F. Engelmann and P. Elia, “A content-delivery protocol, exploiting the privacy benefits of coded caching,” 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, pp. 1–6, 2017.
• K. Wan and G. Caire, “On Coded Caching With Private Demands,” IEEE Transactions on Information Theory, vol. 67, no. 1, pp. 358–372, 2021.
• Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “Characterizing the rate- memory tradeoff in cache networks within a factor of 2,” IEEE Transactions on Information Theory, vol. 65, no. 1, pp. 647–663, 2017.
• Z. Chen, Y. Liu, B. Zhou, and M. Tao, “Caching incentive de# wireless D2D networks: A Stackelberg game approach,” International Conference on Communications, pp. 1–6, 2016.
• M. A. Maddah-Ali and U. Niesen, “Coding for caching: fundamental limits and practical challenges,” IEEE Communications Magazine, vol. 54, no. 8, pp. 23–29, 2016.
• B. N. Bharath, K. G. Nagananda, and H. V. Poor, “A learning-based approach to caching in heterogenous small cell networks,” IEEE Transactions on Com- munications, vol. 64, no. 4, pp. 1674–1686, 2016.
• L. Li, G. Zhao, and R. S. Blum, “A Survey of Caching Techniques in Cellular Networks: Research Issues and Challenges in Content Placement and Deliv- ery Strategies,” IEEE Communications Surveys and Tutorials, vol. 20, no. 3, pp. 1710–1732, 2018.