Papers
Topics
Authors
Recent
Search
2000 character limit reached

Adapt or Wait: Quality Adaptation for Cache-aided Channels

Published 3 Mar 2024 in cs.IT and math.IT | (2403.01558v1)

Abstract: This work focuses on quality adaptation as a means to counter the effects of channel degradation in wireless, cache-aided channels. We design a delivery scheme which combines coded caching, superposition coding, and scalable source coding, while keeping the caching scheme oblivious to channel qualities. By properly adjusting the quality at the degraded users we are able to satisfy all demands in a time-efficient manner. In addition, superposition coding allows us to serve high-rate users with high content quality without subjecting them to a delay penalty caused by users with lower rate channels. We design a communication framework that covers all possible channel rate and quality configurations and we further provide algorithms that can optimise the served quality. An interesting outcome of this work is that a modest quality reduction at the degraded users can counter the effects of significant channel degradation. For example, in a 100-user system with normalized cache size 1/10 at each user, if 10 users experience channel degradation of 60% compared to the rate of the non-degraded users, we show that our transmission strategy leads to a 85% quality at the degraded users and perfect quality at the non-degraded users.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (62)
  1. M. A. Maddah-Ali and U. Niesen, “Fundamental limits of caching,” IEEE Trans. on Inf. Theory, vol. 60, pp. 2856–2867, May 2014.
  2. K. Wan, D. Tuninetti, and P. Piantanida, “An index coding approach to caching with uncoded cache placement,” IEEE Trans. on Inf. Theory, vol. 66, no. 3, pp. 1318–1332, 2020.
  3. Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “The exact rate-memory tradeoff for caching with uncoded prefetching,” IEEE Trans. on Inf. Theory, vol. 64, pp. 1281–1296, Feb 2018.
  4. Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “Characterizing the rate-memory tradeoff in cache networks within a factor of 2,” IEEE Trans. on Inf. Theory, vol. 65, pp. 647–663, Jan 2019.
  5. M. A. Maddah-Ali and U. Niesen, “Decentralized Coded Caching attains order-optimal memory-rate tradeoff,” IEEE/ACM Trans. on Networking, vol. 23, pp. 1029–1040, Aug 2015.
  6. M. Mohammadi Amiri, Q. Yang, and D. Gündüz, “Decentralized caching and coded delivery with distinct cache capacities,” IEEE Trans. on Communications, vol. 65, pp. 4657–4669, Nov 2017.
  7. K. Ngo, S. Yang, and M. Kobayashi, “Scalable content delivery with Coded Caching in multi-antenna fading channels,” IEEE Trans. on Wireless Communications, vol. 17, pp. 548–562, Jan 2018.
  8. S. P. Shariatpanahi, G. Caire, and B. Hossein Khalaj, “Physical-layer schemes for wireless Coded Caching,” IEEE Trans. on Inf. Theory, vol. 65, pp. 2792–2807, May 2019.
  9. N. Naderializadeh, M. A. Maddah-Ali, and A. S. Avestimehr, “Fundamental limits of cache-aided interference management,” IEEE Trans. on Inf. Theory, vol. 63, pp. 3092–3107, May 2017.
  10. E. Lampiris and P. Elia, “Full coded caching gains for cache-less users,” in IEEE Inf. Theory Workshop (ITW), pp. 1–5, Nov 2018.
  11. B. Serbetci, E. Lampiris, T. Spyropoulos, and P. Elia, “Augmenting multiple-transmitter Coded Caching using popularity knowledge at the transmitters,” in 18th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), June 2020.
  12. J. Hachem, N. Karamchandani, and S. N. Diggavi, “Coded Caching for multi-level popularity and access,” IEEE Trans. on Inf. Theory, vol. 63, pp. 3108–3141, May 2017.
  13. M. Ji, A. M. Tulino, J. Llorca, and G. Caire, “Order-optimal rate of caching and coded multicasting with random demands,” IEEE Trans. on Inf. Theory, vol. 63, no. 6, pp. 3923–3949, 2017.
  14. M. Ji, A. M. Tulino, J. Llorca, and G. Caire, “Order optimal coded caching-aided multicast under Zipf demand distributions,” in International Symposium on Wireless Communication Systems (ISWCS), 2014.
  15. J. Zhang, X. Lin, and X. Wang, “Coded caching under arbitrary popularity distributions,” IEEE Trans. on Inf. Theory, vol. 64, no. 1, pp. 349–366, 2017.
  16. A. M. Ibrahim, A. A. Zewail, and A. Yener, “Device-to-Device Coded-Caching with distinct cache sizes,” IEEE Trans. on Communications, vol. 68, no. 5, pp. 2748–2762, 2020.
  17. A. M. Ibrahim, A. A. Zewail, and A. Yener, “Device-to-Device Coded Caching with heterogeneous cache sizes,” in 2018 IEEE International Conference on Communications (ICC), pp. 1–6, IEEE, 2018.
  18. H. B. Mahmoodi, J. Kaleva, S. P. Shariatpanahi, B. H. Khalaj, and A. Tölli, “D2D assisted beamforming for coded caching,” CoRR, vol. abs/1905.05446, 2019.
  19. H. Ghasemi and A. Ramamoorthy, “Asynchronous Coded Caching with uncoded prefetching,” IEEE/ACM Trans. on Networking, pp. 1–14, 2020.
  20. Q. Yang, M. Mohammadi Amiri, and D. Gündüz, “Audience-retention-rate-aware caching and coded video delivery with asynchronous demands,” IEEE Trans. on Communications, vol. 67, no. 10, pp. 7088–7102, 2019.
  21. E. Lampiris, H. Joudeh, G. Caire, and P. Elia, “Coded Caching under asynchronous demands,” in 2021 IEEE International Symposium on Inf. Theory (ISIT), pp. 718–723, IEEE, 2021.
  22. A. Destounis, A. Ghorbel, G. S. Paschos, and M. Kobayashi, “Adaptive Coded Caching for fair delivery over fading channels,” IEEE Trans. on Inf. Theory, vol. 66, no. 7, pp. 4530–4546, 2020.
  23. J. Zhang, F. Engelmann, and P. Elia, “Coded Caching for reducing CSIT-feedback in wireless communications,” in 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 1099–1105, Sep. 2015.
  24. M. Tao, D. Gündüz, F. Xu, and J. S. P. Roig, “Content caching and delivery in wireless radio access networks,” IEEE Trans. on Communications, pp. 1–1, 2019.
  25. J. Zhang and P. Elia, “Fundamental limits of cache-aided wireless bc: Interplay of coded-caching and csit feedback,” IEEE Trans. on Inf. Theory, vol. 63, no. 5, pp. 3142–3160, 2017.
  26. J. Zhang, F. Engelmann, and P. Elia, “Coded caching for reducing csit-feedback in wireless communications,” in 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 1099–1105, IEEE, 2015.
  27. E. Lampiris, A. Bazco-Nogueras, and P. Elia, “Resolving the feedback bottleneck of multi-antenna coded caching,” IEEE Trans. on Inf. Theory, vol. 68, no. 4, pp. 2331–2348, 2021.
  28. E. Lampiris and P. Elia, “Adding transmitters dramatically boosts Coded-Caching gains for finite file sizes,” IEEE Journal on Selected Areas in Communications (JSAC), vol. 36, pp. 1176–1188, June 2018.
  29. X. Zhang, N. Woolsey, and M. Ji, “Cache-aided interference management using hypercube combinatorial cache designs,” in 2019 IEEE International Conference on Communications (ICC), pp. 1–6, 2019.
  30. B. Serbetci, E. Lampiris, T. Spyropoulos, G. Caire, and P. Elia, “Multi-transmitter coded caching networks with transmitter-side knowledge of file popularity,” IEEE/ACM Trans. on Networking, vol. 31, no. 3, pp. 1277–1292, 2023.
  31. E. Lampiris and P. Elia, “Bridging two extremes: Multi-antenna coded caching with reduced subpacketization and CSIT,” SPAWC, 2019.
  32. E. Lampiris and P. Elia, “Full Coded Caching gains for cache-less users,” IEEE Trans. on Inf. Theory, Aug 2020.
  33. E. Lampiris, J. Zhang, O. Simeone, and P. Elia, “Fundamental limits of wireless caching under uneven-capacity channels,” in Internation Zurich Seminar (IZS), Feb 2020.
  34. J. Zhang and P. Elia, “Wireless coded caching: A topological perspective,” in IEEE International Symposium on Inf. Theory (ISIT), pp. 401–405, June 2017.
  35. A. Tolli, S. P. Shariatpanahi, J. Kaleva, and B. Khalaj, “Multicast beamformer design for coded caching,” in IEEE International Symposium on Inf. Theory (ISIT), pp. 1914–1918, June 2018.
  36. M. M. Amiri and D. Gündüz, “Caching and coded delivery over gaussian broadcast channels for energy efficiency,” IEEE Journal on Selected Areas in Communications, vol. 36, no. 8, pp. 1706–1720, 2018.
  37. H. Joudeh, E. Lampiris, P. Elia, and G. Caire, “Fundamental limits of wireless caching under mixed cacheable and uncacheable traffic,” IEEE Trans. on Inf. Theory, vol. 67, no. 7, pp. 4747–4767, 2021.
  38. T. Stockhammer, “Dynamic adaptive streaming over http– standards and design principles,” in Proceedings of the second annual ACM conference on Multimedia systems, pp. 133–144, 2011.
  39. J. Kua, G. Armitage, and P. Branch, “A survey of rate adaptation techniques for dynamic adaptive streaming over HTTP,” IEEE Communications Surveys &\&& Tutorials, vol. 19, no. 3, pp. 1842–1866, 2017.
  40. Q. Yang and D. Gündüz, “Coded caching and content delivery with heterogeneous distortion requirements,” IEEE Trans. on Inf. Theory, vol. 64, no. 6, pp. 4347–4364, 2018.
  41. M. Bayat, C. Yapar, and G. Caire, “Spatially scalable lossy coded caching,” in 2018 15th International Symposium on Wireless Communication Systems (ISWCS), pp. 1–6, IEEE, 2018.
  42. P. Hassanzadeh, E. Erkip, J. Llorca, and A. Tulino, “Distortion-memory tradeoffs in cache-aided wireless video delivery,” in 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 1150–1157, IEEE, 2015.
  43. A. M. Ibrahim, A. A. Zewail, and A. Yener, “On coded caching with heterogeneous distortion requirements,” in 2018 Inf. Theory and Applications Workshop (ITA), pp. 1–9, IEEE, 2018.
  44. E. Parrinello, A. Ünsal, and P. Elia, “Optimal Coded Caching under statistical QoS information,” in 2019 IEEE International Symposium on Inf. Theory (ISIT), pp. 2987–2991, 2019.
  45. Z. Bar-Yossef, Y. Birk, T. S. Jayram, and T. Kol, “Index coding with side information,” IEEE Trans. on Inf. Theory, vol. 57, pp. 1479–1494, March 2011.
  46. M. M. Amiri and D. Gündùz, “On the capacity region of a cache-aided Gaussian broadcast channel with multi-layer messages,” in 2018 IEEE International Symposium on Inf. Theory (ISIT), pp. 1909–1913, 2018.
  47. M. Salehi, A. Tölli, and S. P. Shariatpanahi, “Coded caching with uneven channels: A quality of experience approach,” in 2020 IEEE 21st International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), pp. 1–5, IEEE, 2020.
  48. H. Schwarz, D. Marpe, and T. Wiegand, “Overview of the scalable video coding extension of the h. 264/avc standard,” IEEE Trans. on circuits and systems for video technology, vol. 17, no. 9, pp. 1103–1120, 2007.
  49. C. Geng, N. Naderializadeh, A. S. Avestimehr, and S. A. Jafar, “On the optimality of treating interference as noise,” IEEE Transactions on Information Theory, vol. 61, no. 4, pp. 1753–1767, 2015.
  50. S. A. Jafar and S. Vishwanath, “Generalized Degrees of Freedom of the symmetric Gaussian K𝐾Kitalic_K user Interference Channel,” IEEE Trans. on Inf. Theory, vol. 56, pp. 3297–3303, July 2010.
  51. A. Gholami Davoodi and S. A. Jafar, “Aligned image sets under channel uncertainty: Settling conjectures on the collapse of degrees of freedom under finite precision CSIT,” IEEE Trans. on Inf. Theory, vol. 62, pp. 5603–5618, Oct 2016.
  52. A. Gholami Davoodi and S. A. Jafar, “Generalized degrees of freedom of the symmetric k𝑘kitalic_k user interference channel under finite precision CSIT,” IEEE Trans. on Inf. Theory, vol. 63, pp. 6561–6572, Oct 2017.
  53. M. Salman and M. K. Varanasi, “The exact capacity-memory tradeoff for caching with uncoded prefetching in the two-receiver gaussian broadcast channel,” in 2019 IEEE International Symposium on Information Theory (ISIT), pp. 1222–1226, IEEE, 2019.
  54. E. Piovano, H. Joudeh, and B. Clerckx, “Robust cache-aided interference management under full transmitter cooperation,” in 2018 IEEE International Symposium on Information Theory (ISIT), pp. 1540–1544, 2018.
  55. E. Piovano, H. Joudeh, and B. Clerckx, “Generalized degrees of freedom of the symmetric cache-aided miso broadcast channel with partial csit,” IEEE Transactions on Information Theory, vol. 65, no. 9, pp. 5799–5815, 2019.
  56. E. Lampiris, J. Zhang, and P. Elia, “Cache-aided cooperation with no csit,” in 2017 IEEE International Symposium on Information Theory (ISIT), pp. 2960–2964, IEEE, 2017.
  57. A. El Gamal and Y.-H. Kim, Network information theory. Cambridge university press, 2011.
  58. J. Korner and K. Marton, “General broadcast channels with degraded message sets,” IEEE Transactions on Information Theory, vol. 23, no. 1, pp. 60–64, 1977.
  59. C. Nair and A. El Gamal, “The capacity region of a class of three-receiver broadcast channels with degraded message sets,” IEEE Transactions on Information Theory, vol. 55, no. 10, pp. 4479–4493, 2009.
  60. T. M. Cover and J. A. Thomas, Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing). USA: Wiley-Interscience, 2006.
  61. 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.
  62. 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.
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up