2000 character limit reached
Improved Hotplug Caching Schemes Using PDAs and t-Designs
Published 6 Nov 2023 in cs.IT, cs.DM, and math.IT | (2311.02856v3)
Abstract: We consider a coded caching system in which some users are offline at the time of delivery. Such systems are called hotplug coded caching systems. A placement delivery array (PDA) is a well-known tool for constructing a coded caching scheme for dedicated caches. In this paper, we introduce the concept of PDAs for hotplug coded caching schemes and refer to it as a hotplug placement delivery array (HpPDA). We give an algorithm to describe the placement and the delivery phase of a hotplug coded caching scheme using HpPDA. We show that an existing hotplug coded caching scheme given by Y. Ma and D. Tuninetti in 2022 corresponds to a class of HpPDAs and then propose a method to further improve the rate of that scheme. Additionally, we construct a class of HpPDAs using $t$-designs, which corresponds to a scheme for hotplug coded caching systems. We further improve the rate of this scheme and prove that the cut-set bound is achieved in some higher memory range for a hotplug coded caching system with three active users.
- M. A. Maddah-Ali and U. Niesen, “Fundamental limits of caching,” IEEE Transactions on Information Theory, vol. 60, no. 5, pp. 2856–2867, 2014.
- M. M. Amiri, Q. Yang, and D. Gündüz, “Coded caching for a large number of users,” in 2016 IEEE Information Theory Workshop (ITW). IEEE, 2016, pp. 171–175.
- Z. Chen, P. Fan, and K. B. Letaief, “Fundamental limits of caching: Improved bounds for users with small buffers,” IET Communications, vol. 10, no. 17, pp. 2315–2318, 2016.
- Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “The exact rate-memory tradeoff for caching with uncoded prefetching,” IEEE Transactions on Information Theory, vol. 64, no. 2, pp. 1281–1296, 2017.
- H. Ghasemi and A. Ramamoorthy, “Improved lower bounds for coded caching,” IEEE Transactions on Information Theory, vol. 63, no. 7, pp. 4388–4413, 2017.
- P. N. Muralidhar, D. Katyal, and B. S. Rajan, “Maddah-ali-niesen scheme for multi-access coded caching,” in 2021 IEEE Information Theory Workshop (ITW). IEEE, 2021, pp. 1–6.
- K. Wan, D. Tuninetti, and P. Piantanida, “An index coding approach to caching with uncoded cache placement,” IEEE Transactions on Information Theory, vol. 66, no. 3, pp. 1318–1332, 2020.
- M. A. Maddah-Ali and U. Niesen, “Decentralized coded caching attains order-optimal memory-rate tradeoff,” IEEE/ACM Transactions On Networking, vol. 23, no. 4, pp. 1029–1040, 2014.
- N. Karamchandani, U. Niesen, M. A. Maddah-Ali, and S. N. Diggavi, “Hierarchical coded caching,” IEEE Transactions on Information Theory, vol. 62, no. 6, pp. 3212–3229, 2016.
- U. Niesen and M. A. Maddah-Ali, “Coded caching with nonuniform demands,” IEEE Transactions on Information Theory, vol. 63, no. 2, pp. 1146–1158, 2016.
- S. P. Shariatpanahi, G. Caire, and B. H. Khalaj, “Multi-antenna coded caching,” in 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017, pp. 2113–2117.
- J. Hachem, N. Karamchandani, and S. N. Diggavi, “Coded caching for multi-level popularity and access,” IEEE Transactions on Information Theory, vol. 63, no. 5, pp. 3108–3141, 2017.
- K. Wan and G. Caire, “On coded caching with private demands,” IEEE Transactions on Information Theory, vol. 67, no. 1, pp. 358–372, 2020.
- Y. Ma and D. Tuninetti, “On coded caching systems with offline users,” in 2022 IEEE International Symposium on Information Theory (ISIT). IEEE, 2022, pp. 1133–1138.
- S. Ling, and C. Xing, “Coding theory: a first course,” Cambridge University Press, 2004.
- J. Liao and O. Tirkkonen, “Fundamental rate-memory tradeoff for coded caching in presence of user inactivity,” arXiv preprint arXiv:2109.14680, 2021.
- Y. Ma and D. Tuninetti, “Demand privacy in hotplug caching systems,” arXiv preprint arXiv:2305.06518, 2023.
- Q. Yan, M. Cheng, X. Tang, and Q. Chen, “On the placement delivery array design for centralized coded caching scheme,” IEEE Transactions on Information Theory, vol. 63, no. 9, pp. 5821–5833, 2017.
- Q. Yan, X. Tang, Q. Chen, and M. Cheng, “Placement delivery array design through strong edge coloring of bipartite graphs,” IEEE Communications Letters, vol. 22, no. 2, pp. 236–239, 2017.
- C. Shangguan, Y. Zhang, and G. Ge, “Centralized coded caching schemes: A hypergraph theoretical approach,” IEEE Transactions on Information Theory, vol. 64, no. 8, pp. 5755–5766, 2018.
- M. Cheng, J. Jiang, Q. Yan, and X. Tang, “Constructions of coded caching schemes with flexible memory size,” IEEE Transactions on Communications, vol. 67, no. 6, pp. 4166–4176, 2019.
- J. Michel and Q. Wang, “Placement delivery arrays from combinations of strong edge colorings,” IEEE Transactions on Communications, vol. 68, no. 10, pp. 5953–5964, 2020.
- X. Zhong, M. Cheng, and J. Jiang, “Placement delivery array based on concatenating construction,” IEEE Communications Letters, vol. 24, no. 6, pp. 1216–1220, 2020.
- M. Cheng, J. Jiang, X. Tang, and Q. Yan, “Some variant of known coded caching schemes with good performance,” IEEE Transactions on Communications, vol. 68, no. 3, pp. 1370–1377, 2019.
- S. Agrawal, K. S. Sree, and P. Krishnan, “Coded caching based on combinatorial designs,” in 2019 IEEE International Symposium on Information Theory (ISIT), IEEE, 2019, pp. 1227-1231.
- J. Li and Y. Chang, “Placement Delivery Arrays Based on Combinatorial Designs,” in IEEE Communications Letters, vol. 26, no. 2, pp. 296-300, 2022.
- M. Cheng, K. Wan, P. Elia, and G. Caire, “Coded Caching Schemes for Multiaccess Topologies via Combinatorial Design,” arXiv preprint arXiv:2310.20239, 2023.
- D. Katyal, P. N. Muralidhar, and B. S. Rajan, “Multi-access coded caching schemes from cross resolvable designs,” IEEE Transactions on Communications, vol. 69, no. 5, pp. 2997-3010, 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, 2018.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.