Multi-Server Coded Caching

In this paper, we consider multiple cache-enabled clients connected to multiple servers through an intermediate network. We design several topology-aware coding strategies for such networks. Based on the topology richness of the intermediate network, and types of coding operations at internal nodes, we define three classes of networks, namely, dedicated, flexible, and linear networks. For each class, we propose an achievable coding scheme, analyze its coding delay, and also compare it with an information theoretic lower bound. For flexible networks, we show that our scheme is order-optimal in terms of coding delay and, interestingly, the optimal memory-delay curve is achieved in certain regimes. In general, our results suggest that, in the case of networks with multiple servers, type of network topology can be exploited to reduce service delay.

[1]  Suhas N. Diggavi,et al.  On the capacity of non-coherent network coding , 2009, 2009 IEEE International Symposium on Information Theory.

[2]  Urs Niesen,et al.  Fundamental limits of caching , 2012, 2013 IEEE International Symposium on Information Theory.

[3]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.

[4]  Urs Niesen,et al.  Coded caching for delay-sensitive content , 2014, 2015 IEEE International Conference on Communications (ICC).

[5]  Mohammad Ali Maddah-Ali,et al.  Fundamental limits of cache-aided interference management , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[6]  S. Diggavi,et al.  Noncoherent multi-source network coding , 2008 .

[7]  László Böszörményi,et al.  A survey of Web cache replacement strategies , 2003, CSUR.

[8]  Urs Niesen,et al.  Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  En-Hui Yang,et al.  Coding for linear operator channels over finite fields , 2010, 2010 IEEE International Symposium on Information Theory.

[10]  Athina Markopoulou,et al.  Network coding for multiple unicasts: An interference alignment approach , 2010, 2010 IEEE International Symposium on Information Theory.

[11]  Urs Niesen,et al.  Decentralized Caching Attains Order-Optimal Memory-Rate Tradeoff , 2013, ArXiv.

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

[13]  George Pallis,et al.  Content Delivery Networks: Status and Trends , 2003, IEEE Internet Comput..

[14]  Athina Markopoulou,et al.  Precoding-Based Network Alignment for Three Unicast Sessions , 2012, IEEE Transactions on Information Theory.

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

[16]  Frank R. Kschischang,et al.  Communication Over Finite-Field Matrix Channels , 2008, IEEE Transactions on Information Theory.

[17]  Suhas N. Diggavi,et al.  Noncoherent multisource network coding , 2008, 2008 IEEE International Symposium on Information Theory.

[18]  Leandros Tassiulas,et al.  Asymptotic laws for content replication and delivery in wireless networks , 2012, 2012 Proceedings IEEE INFOCOM.

[19]  Suhas N. Diggavi,et al.  On the Capacity of Noncoherent Network Coding , 2011, IEEE Transactions on Information Theory.

[20]  Jussi Kangasharju,et al.  Object replication strategies in content distribution networks , 2002, Comput. Commun..

[21]  Shenghao Yang,et al.  Coding for a network coded fountain , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

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

[23]  En-Hui Yang,et al.  Linear Operator Channels over Finite Fields , 2010, ArXiv.

[24]  Babak Hassibi,et al.  On the capacity of MIMO broadcast channels with partial side information , 2005, IEEE Transactions on Information Theory.

[25]  Randy H. Katz,et al.  Dynamic Replica Placement for Scalable Content Delivery , 2002, IPTPS.

[26]  T. Ho,et al.  On Linear Network Coding , 2010 .