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.
- E. Altman, K. Avrachenkov, and J. Goseling, "Distributed storage in the plane", Networking Conference, IFIP 2014, pp. 1--9, Trondheim, Norway, June 2014.Google Scholar
Cross Ref
- E. Altman, B. Gaujal, and A. Hordijk, Discrete-event control of stochastic networks: Multimodularity and regularity, Springer, 2003. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- K. Avrachenkov, X. Bai, and J. Goseling, "Optimization of caching devices with geometric constraints", arXiv preprint arXiv: 1602.03635, 2016.Google Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
Cross Ref
- S. Borst, V. Gupta, and A. Walid, "Distributed caching algorithms for content distribution networks", Proceedings of IEEE INFOCOM 2010. Google Scholar
Digital Library
- A. Chattopadhyay, and B. Błaszczyszyn, "Gibbsian on-Line distributed content caching strategy for cellular networks", arXiv preprint arXiv: 1610.02318, 2016.Google Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- R. Durstenfeld, "Algorithm 235: Random permutation", Communications of the ACM Magazine, vol.7, no. 7, p. 420, July 1964. Google Scholar
Digital Library
- R. Fagin, "Asymptotic miss ratios over independent references", Journal of Computer and System Sciences, vol. 14, no. 2, pp. 222--250.Google Scholar
Cross Ref
- A. R. Fisher, and F. Yates, Statistical tables for biological, agricultural and medical research, 1st edn. Oliver and Boyd, Edinburgh, 1938.Google Scholar
- N.C. Fofack, P. Nain, G. Neglia, and D. Towsley, "Analysis of TTL-based cache networks", Proccedings of VALUETOOLS 2012.Google Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- C. Fricker, P. Robert, and J. Roberts, "A versatile and accurate approximation for LRU cache performance", Proceedings of ITC 2012. Google Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- 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 Scholar
Cross Ref
- 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 Scholar
- B. Hajek, "Cooling schedules for optimal annealing ", Mathematics of operations research, vol. 13, no. 2, pp. 311--329, May 1988. Google Scholar
Digital Library
- S. Ioannidis, L. Massoulie, A. Chaintreau, "Distributed caching over heterogeneous mobile networks", SIGMETRICS 2010, pp. 311--322, NY, USA, June 2010. Google Scholar
Digital Library
- W. Jiang, S. Ioannidis, L. Massoulié, and F. Picconi, "Orchestrating massively distributed CDNs", Proceedings of ACM CoNEXT 2012. pp. 133--144. Google Scholar
Digital Library
- M. A. Maddah-Ali, and U. Niesen, "Fundamental limits of caching", IEEE Transactions on Information Theory, vol. 60, pp. 2856 - 2867, May 2014.Google Scholar
Cross Ref
- 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 Scholar
Cross Ref
- 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 Scholar
Digital Library
- D. Monderer, and L. Shapley, "Potential games", Games and Economic Behavior, vol. 14, pp. 124--143, 1996.Google Scholar
Cross Ref
- G. Neglia, D. Carra, and P. Michiardi, "Cache policies for linear utility maximization", Proceedings of IEEE INFOCOM 2017.Google Scholar
Cross Ref
- Y. Nesterov, and A. Nemirovskii, Interior-point polynomial algorithms in convex programming. SIAM.Google Scholar
- M. E. J. Newman, "Power laws, Pareto distributions and Zipf's law", Contemporary Physics, vol.46, pp. 323--351, 2005.Google Scholar
Cross Ref
- 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 Scholar
Cross Ref
- 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 Scholar
- E.J. Rosensweig, J. Kurose, and D. Towsley, "Approximate models for general cache networks". Proceedings of IEEE INFOCOM 2010. Google Scholar
Digital Library
- E.J. Rosensweig, D.S. Menasche, and J. Kurose, "On the steady-state of cache networks", Proccedings of IEEE INFOCOM 2013.Google Scholar
Cross Ref
- A. Sengupta, R. Tandon, and O. Simeone, "Cloud and cache-Aided wireless networks: Fundamental latency trade-offs", arXiv preprint arXiv: 1605.01690, 2016.Google Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Cross Ref
- V. Sindhwani, S.S. Keerthi, and O. Chapelle, "Deterministic annealing for semi-supervised kernel machines", In Proceedings of ICML 2006, pp. 841--848. Google Scholar
Digital Library
- E. Tardos, and T.Wexler, "Network formation games and the potential function method", chapter in Algorithmic Game Theory, pp.487--516, 2007.Google Scholar
- M. Yannakakis, "Equilibria, fixed points, and complexity classes", Computer Science Review, vol. 3, no.2, pp. 71--85, May 2009. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- OpenMobileNetwork, http://map.openmobilenetwork.org/.Google Scholar
Index Terms
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints
Recommendations
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints
Performance evaluation reviewA promising means to increase efficiency of cellular networks compared to existing architectures is to proactively cache data in the base stations. The idea is to store part of the data at the wireless edge and use the backhaul only to refresh the ...
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints
SIGMETRICS '17 Abstracts: Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer SystemsA promising means to increase efficiency of cellular networks compared to existing architectures is to proactively cache data in the base stations. The idea is to store part of the data at the wireless edge and use the backhaul only to refresh the ...
Cooperative Caching for Chip Multiprocessors
ISCA '06: Proceedings of the 33rd annual international symposium on Computer ArchitectureThis paper presents CMP Cooperative Caching, a unified framework to manage a CMP's aggregate on-chip cache resources. Cooperative caching combines the strengths of private and shared cache organizations by forming an aggregate "shared" cache through ...






Comments