skip to main content
research-article

A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints

Published:13 June 2017Publication History
Skip Abstract Section

Abstract

We consider caching in cellular networks in which each base station is equipped with a cache that can store a limited number of files. The popularity of the files is known and the goal is to place files in the caches such that the probability that a user at an arbitrary location in the plane will find the file that she requires in one of the covering caches is maximized.

We develop distributed asynchronous algorithms for deciding which contents to store in which cache. Such cooperative algorithms require communication only between caches with overlapping coverage areas and can operate in asynchronous manner. The development of the algorithms is principally based on an observation that the problem can be viewed as a potential game. Our basic algorithm is derived from the best response dynamics. We demonstrate that the complexity of each best response step is independent of the number of files, linear in the cache capacity and linear in the maximum number of base stations that cover a certain area. Then, we show that the overall algorithm complexity for a discrete cache placement is polynomial in both network size and catalog size. In practical examples, the algorithm converges in just a few iterations. Also, in most cases of interest, the basic algorithm finds the best Nash equilibrium corresponding to the global optimum. We provide two extensions of our basic algorithm based on stochastic and deterministic simulated annealing which find the global optimum.

Finally, we demonstrate the hit probability evolution on real and synthetic networks numerically and show that our distributed caching algorithm performs significantly better than storing the most popular content, probabilistic content placement policy and Multi-LRU caching policies.

References

  1. E. Altman, K. Avrachenkov, and J. Goseling, "Distributed storage in the plane", Networking Conference, IFIP 2014, pp. 1--9, Trondheim, Norway, June 2014.Google ScholarGoogle ScholarCross RefCross Ref
  2. E. Altman, B. Gaujal, and A. Hordijk, Discrete-event control of stochastic networks: Multimodularity and regularity, Springer, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden, "The price of stability for network design with fair cost allocation", SIAM Journal on Computing, vol. 38, no. 4, pp. 1602--1623, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. K. Avrachenkov, X. Bai, and J. Goseling, "Optimization of caching devices with geometric constraints", arXiv preprint arXiv: 1602.03635, 2016.Google ScholarGoogle Scholar
  5. K. Avrachenkov, J. Elias, F. Martignon, G. Neglia, and L. Petrosyan, "Cooperative Network Design: A Nash bargaining solution approach", Computer Networks, vol. 83, pp. 265--279, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. I. Baev, R. Rajaraman, and C. Swamy, "Approximation algorithms for data placement problems", SIAM Journal on Computing, vol. 38, no.4, pp. 1411--1429, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. E. Bastug, M. Bennis, and M. Debbah, ?Cache-enabled small cell networks: Modeling and tradeoffs", 11th International Symposium on Wireless Communications Systems, pp. 649--653, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  8. B. Błaszczyszyn, and A. Giovanidis, "Optimal geographic caching in cellular networks", IEEE International Conference on Communications (ICC) 2015, pp. 3358--3363, London, UK, June 2015.Google ScholarGoogle ScholarCross RefCross Ref
  9. S. Borst, V. Gupta, and A. Walid, "Distributed caching algorithms for content distribution networks", Proceedings of IEEE INFOCOM 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Chattopadhyay, and B. Błaszczyszyn, "Gibbsian on-Line distributed content caching strategy for cellular networks", arXiv preprint arXiv: 1610.02318, 2016.Google ScholarGoogle Scholar
  11. W. Chai, D. He, I. Psaras, and G. Pavlou, "Cache 'less for more' in information-centric networks", Proceedings of IFIP Networking 2012, pp. 27--40. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. H. Che, Y. Tung, and Z. Wang, "Hierarchical web caching systems: Modeling, design and experimental results", IEEE Journal on Selected Areas in Communications, vol. 20, no. 7, pp. 1305--1314, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. A. Dan, and D. Towsley, "An approximate analysis of the LRU and FIFO buffer replacement schemes", ACM Performance Evaluation Review, vol. 18, no. 1, pp. 143--152, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. M. Dehghan, L. Massoulie, D. Towsley, D. Menasche, Y. C. Tay, "A utility optimization approach to network cache design", Proccedings of IEEE INFOCOM 2016, San Francisco, CA, USA, April 2016.Google ScholarGoogle ScholarCross RefCross Ref
  15. R. Durstenfeld, "Algorithm 235: Random permutation", Communications of the ACM Magazine, vol.7, no. 7, p. 420, July 1964. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. R. Fagin, "Asymptotic miss ratios over independent references", Journal of Computer and System Sciences, vol. 14, no. 2, pp. 222--250.Google ScholarGoogle ScholarCross RefCross Ref
  17. A. R. Fisher, and F. Yates, Statistical tables for biological, agricultural and medical research, 1st edn. Oliver and Boyd, Edinburgh, 1938.Google ScholarGoogle Scholar
  18. N.C. Fofack, P. Nain, G. Neglia, and D. Towsley, "Analysis of TTL-based cache networks", Proccedings of VALUETOOLS 2012.Google ScholarGoogle Scholar
  19. N.C. Fofack, M. Dehghan, D. Towsley, M. Badov, and D.L. Goeckel, "On the performance of general cache networks", Proccedings of VALUETOOLS 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. N.C. Fofack, P. Nain, G. Neglia, and D. Towsley, "Performance evaluation of hierarchical TTL-based cache networks", Computer Networks, vol. 65, pp. 212--231, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  21. C. Fricker, P. Robert, and J. Roberts, "A versatile and accurate approximation for LRU cache performance", Proceedings of ITC 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. C. Fricker, P. Robert, J. Roberts, and N. Sbihi, "Impact of traffic mix on caching performance in a content-centric network", Proccedings of IEEE NOMEN 2012.Google ScholarGoogle ScholarCross RefCross Ref
  23. M. Garetto, E. Leonardi, and V. Martina, "A unified approach to the performance analysis of caching systems", ACM Transactions on Modeling and Performance Evaluation of Computing Systems, vol. 1, no. 3, p.12, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. A. Giovanidis, and A. Avranas, "Spatial multi-LRU caching for wireless networks with coverage overlaps", Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, pp. 403--405, Antibes Juan-les-Pins, France, June 2016. An extended version is available at https://arxiv.org/abs/1612.04363 Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. N. Golrezaei, K. Shanmugam, A.G. Dimakis, A.F. Molisch, and G. Caire, "Femtocaching: Wireless video content delivery through distributed caching helpers", Proceedings of IEEE INFOCOM 2012.Google ScholarGoogle ScholarCross RefCross Ref
  26. N. Golrezaei, A. F. Molisch, A. G. Dimakis, and G. Caire, "Femtocaching and Device-to-Device collaboration: A new architecture for wireless video distribution", IEEE Communications Magazine, vol. 51, no. 4, pp. 142--149, April 2013.Google ScholarGoogle ScholarCross RefCross Ref
  27. J. Goseling, O. Simeone, and P. Popovski, "Delivery latency regions in Fog-RANs with edge caching and cloud processing ", arXiv preprint arXiv: 1701.06303, 2017.Google ScholarGoogle Scholar
  28. B. Hajek, "Cooling schedules for optimal annealing ", Mathematics of operations research, vol. 13, no. 2, pp. 311--329, May 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. S. Ioannidis, L. Massoulie, A. Chaintreau, "Distributed caching over heterogeneous mobile networks", SIGMETRICS 2010, pp. 311--322, NY, USA, June 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. W. Jiang, S. Ioannidis, L. Massoulié, and F. Picconi, "Orchestrating massively distributed CDNs", Proceedings of ACM CoNEXT 2012. pp. 133--144. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. M. A. Maddah-Ali, and U. Niesen, "Fundamental limits of caching", IEEE Transactions on Information Theory, vol. 60, pp. 2856 - 2867, May 2014.Google ScholarGoogle ScholarCross RefCross Ref
  32. M. A. Maddah-Ali, and U. Niesen, "Cache-aided interference channels", IEEE International Symposium on Information Theory Proceedings (ISIT) 2015, pp. 809--813, June 2015.Google ScholarGoogle ScholarCross RefCross Ref
  33. S. Moharir, J. Ghaderi, S. Sanghavi, and S. Shakkottai, "Serving content with unknown demand: the high-dimensional regime", ACM SIGMETRICS Performance Evaluation Review, vol. 42, no. 1, pp. 435--447. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. D. Monderer, and L. Shapley, "Potential games", Games and Economic Behavior, vol. 14, pp. 124--143, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  35. G. Neglia, D. Carra, and P. Michiardi, "Cache policies for linear utility maximization", Proceedings of IEEE INFOCOM 2017.Google ScholarGoogle ScholarCross RefCross Ref
  36. Y. Nesterov, and A. Nemirovskii, Interior-point polynomial algorithms in convex programming. SIAM.Google ScholarGoogle Scholar
  37. M. E. J. Newman, "Power laws, Pareto distributions and Zipf's law", Contemporary Physics, vol.46, pp. 323--351, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  38. K. Poularakis, G. Iosifidis, and L. Tassiulas, "Approximation algorithms for mobile data caching in small cell networks", IEEE Transactions on Communications, vol. 62, no.10, pp. 3665--3677, October 2014.Google ScholarGoogle ScholarCross RefCross Ref
  39. K. Rose, "Deterministic annealing for clustering, compression, classification, regression, and related optimization problems", Proceedings of the IEEE, vol. 86, no.11, pp. 2210--2239, 1998.Google ScholarGoogle Scholar
  40. E.J. Rosensweig, J. Kurose, and D. Towsley, "Approximate models for general cache networks". Proceedings of IEEE INFOCOM 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. E.J. Rosensweig, D.S. Menasche, and J. Kurose, "On the steady-state of cache networks", Proccedings of IEEE INFOCOM 2013.Google ScholarGoogle ScholarCross RefCross Ref
  42. A. Sengupta, R. Tandon, and O. Simeone, "Cloud and cache-Aided wireless networks: Fundamental latency trade-offs", arXiv preprint arXiv: 1605.01690, 2016.Google ScholarGoogle Scholar
  43. K. Shanmugam, N. Golrezaei, A. G. Dimakis, A. F. Molisch, and G. Caire, "FemtoCaching: wireless content delivery through distributed caching helpers", IEEE Transactions on Information Theory, vol. 59, no.12, pp. 8402--8413, December 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. F. Shen, K. Hamidouche, E. Bastug, and M. Debbah, "A Stackelberg game for incentive proactive caching mechanisms in wireless networks", In Proceedings of IEEE GLOBECOM 2016.Google ScholarGoogle ScholarCross RefCross Ref
  45. V. Sindhwani, S.S. Keerthi, and O. Chapelle, "Deterministic annealing for semi-supervised kernel machines", In Proceedings of ICML 2006, pp. 841--848. Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. E. Tardos, and T.Wexler, "Network formation games and the potential function method", chapter in Algorithmic Game Theory, pp.487--516, 2007.Google ScholarGoogle Scholar
  47. M. Yannakakis, "Equilibria, fixed points, and complexity classes", Computer Science Review, vol. 3, no.2, pp. 71--85, May 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. G. Zhang, Y. Li, and T. Lin, "Caching in information centric networking: A survey", Computer Networks, vol. 57, no. 16, pp. 3128--3141, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. J. Zhang, and P. Elia, "Fundamental limits of cache-aided wireless BC: Interplay of coded-caching and CSIT feedback", IEEE Trans. on Information Theory, vol. 63, no. 5, 2017. Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. OpenMobileNetwork, http://map.openmobilenetwork.org/.Google ScholarGoogle Scholar

Index Terms

  1. A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in

                Full Access

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader
                About Cookies On This Site

                We use cookies to ensure that we give you the best experience on our website.

                Learn more

                Got it!