On the complexity of optimal routing and content caching in heterogeneous networks

We investigate the problem of optimal request routing and content caching in a heterogeneous network supporting in-network content caching with the goal of minimizing average content access delay. Here, content can either be accessed directly from a back-end server (where content resides permanently) or be obtained from one of multiple in-network caches. To access a piece of content, a user must decide whether to route its request to a cache or to the back-end server. Additionally, caches must decide which content to cache. We investigate the problem complexity of two problem formulations, where the direct path to the back-end server is modeled as i) a congestion-sensitive or ii) a congestion-insensitive path, reflecting whether or not the delay of the uncached path to the back-end server depends on the user request load, respectively. We show that the problem is NP-complete in both cases. We prove that under the congestion-insensitive model the problem can be solved optimally in polynomial time if each piece of content is requested by only one user, or when there are at most two caches in the network. We also identify a structural property of the user-cache graph that potentially makes the problem NP-complete. For the congestion-sensitive model, we prove that the problem remains NP-complete even if there is only one cache in the network and each content is requested by only one user. We show that approximate solutions can be found for both models within a (1 - 1/e) factor of the optimal solution, and demonstrate a greedy algorithm that is found to be within 1% of optimal for small problem sizes. Through trace-driven simulations we evaluate the performance of our greedy algorithms, which show up to a 50% reduction in average delay over solutions based on LRU content caching.

[1]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[2]  George Pavlou,et al.  Cache "Less for More" in Information-Centric Networks , 2012, Networking.

[3]  Stephan Eidenbenz,et al.  On the Complexity of Variations of Equal Sum Subsets , 2008, Nord. J. Comput..

[4]  Chaitanya Swamy,et al.  Approximation Algorithms for Data Placement Problems , 2008, SIAM J. Comput..

[5]  Cheng Huang,et al.  Understanding hybrid CDN-P2P: why limelight needs its own Red Swoosh , 2008, NOSSDAV.

[6]  Alan J. Hoffman,et al.  Integral Boundary Points of Convex Polyhedra , 2010, 50 Years of Integer Programming.

[7]  Robert Bartle,et al.  The Elements of Real Analysis , 1977, The Mathematical Gazette.

[8]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[9]  James F. Kurose,et al.  On the steady-state of cache networks , 2013, 2013 Proceedings IEEE INFOCOM.

[10]  Leandros Tassiulas,et al.  Cache-aware routing in Information-Centric Networks , 2013, 2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013).

[11]  Bin Tang,et al.  Cache placement in sensor networks under an update cost constraint , 2005, J. Discrete Algorithms.

[12]  Donald F. Towsley,et al.  Approximate Models for General Cache Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[13]  Donald F. Towsley,et al.  Optimal Caching and Routing in Hybrid Networks , 2014, 2014 IEEE Military Communications Conference.

[14]  Igor Tatarinov,et al.  Static caching in Web servers , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[15]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[16]  James F. Kurose,et al.  Breadcrumbs: Efficient, Best-Effort Content Location in Cache Networks , 2009, IEEE INFOCOM 2009.

[17]  Alexandros G. Dimakis,et al.  FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers , 2013, IEEE Transactions on Information Theory.

[18]  Alexandros G. Dimakis,et al.  FemtoCaching: Wireless video content delivery through distributed caching helpers , 2011, 2012 Proceedings IEEE INFOCOM.

[19]  Arun Venkataramani,et al.  Distributing content simplifies ISP traffic engineering , 2012, SIGMETRICS '13.

[20]  Hao Che,et al.  Analysis and design of hierarchical Web caching systems , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[21]  Yonggang Wen,et al.  Coordinating In-Network Caching in Content-Centric Networks: Model and Analysis , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

[22]  Ramesh K. Sitaraman,et al.  The Akamai network: a platform for high-performance internet applications , 2010, OPSR.

[23]  Hamid R. Sadjadpour,et al.  On the throughput capacity of information-centric networks , 2013, Proceedings of the 2013 25th International Teletraffic Congress (ITC).

[24]  Lazaros Gkatzikis,et al.  Distributed Cache Management in Information-Centric Networks , 2013, IEEE Transactions on Network and Service Management.

[25]  Konstantinos Poularakis,et al.  Approximation caching and routing algorithms for massive mobile data delivery , 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

[26]  Leandros Tassiulas,et al.  Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks , 2012, IEEE Transactions on Information Theory.

[27]  Jan Vondrák,et al.  Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) , 2007, IPCO.

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