A Collaborative Framework for In-network Video Caching in Mobile Networks

Due to explosive growth of online video content in mobile wireless networks, in-network caching is becoming increasingly important to improve the end-user experience and reduce the Internet access cost for mobile network operators. However, caching is a difficult problem due to the very large number of online videos and video requests, limited capacity of caching nodes, and limited bandwidth of in-network links. Existing solutions that rely on static configurations and average request arrival rates are insufficient to handle dynamic request patterns effectively. In this paper, we propose a dynamic collaborative video caching framework to be deployed in mobile networks. We decompose the caching problem into a content placement subproblem and a source-selection subproblem. We then develop SRS (System capacity Reservation Strategy) to solve the content placement subproblem, and LinkShare, an adaptive traffic-aware algorithm to solve the source selection subproblem. Our framework supports congestion avoidance and allows merging multiple requests for the same video into one request. We carry extensive simulations to validate the proposed schemes. Simulation results show that our SRS algorithm achieves performance within 1 − 3% of the optimal values and LinkShare significantly outperforms existing solutions.

[1]  Philippe Mahey,et al.  A Survey of Algorithms for Convex Multicommodity Flow Problems , 2000 .

[2]  H. Liu,et al.  Conference on Measurement and modeling of computer systems , 2001 .

[3]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[4]  L. V. Wassenhove,et al.  A survey of algorithms for the generalized assignment problem , 1992 .

[5]  William R. McShane,et al.  A review of pedestrian safety models for urban areas in Low and Middle Income Countries , 2016 .

[6]  Ramesh Johari,et al.  Traffic Engineering vs. Content Distribution: A Game Theoretic Perspective , 2009, IEEE INFOCOM 2009.

[7]  Guangyu Shi,et al.  TECC: Towards collaborative in-network caching guided by traffic engineering , 2012, 2012 Proceedings IEEE INFOCOM.

[8]  Lada A. Adamic Zipf, Power-laws, and Pareto-a ranking tutorial , 2000 .

[9]  H. Edwin Romeijn,et al.  A class of greedy algorithms for the generalized assignment problem , 2000, Discret. Appl. Math..

[10]  Daniel Bienstock,et al.  Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice , 2002 .

[11]  Erik Dahlman,et al.  3G Evolution: HSPA and LTE for Mobile Broadband , 2007 .

[12]  Van Jacobson,et al.  Adaptive web caching: towards a new global caching architecture , 1998, Comput. Networks.

[13]  Pablo Rodriguez,et al.  Analysis of web caching architectures: hierarchical and distributed caching , 2001, TNET.

[14]  Aleksandar Kuzmanovic,et al.  Drafting behind Akamai (travelocity-based detouring) , 2006, SIGCOMM '06.

[15]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[16]  Mung Chiang,et al.  Cooperative content distribution and traffic engineering in an ISP network , 2009, SIGMETRICS '09.

[17]  Seungjoon Lee,et al.  Optimal Content Placement for a Large-Scale VoD System , 2010, IEEE/ACM Transactions on Networking.

[18]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[19]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[20]  Jochen Könemann,et al.  Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems , 2007, SIAM J. Comput..

[21]  Sem C. Borst,et al.  Distributed Caching Algorithms for Content Distribution Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[22]  Aleksandar Kuzmanovic,et al.  Drafting behind Akamai (travelocity-based detouring) , 2006, SIGCOMM 2006.