Order Optimal Coded Delivery and Caching: Multiple Groupcast Index Coding

The capacity of caching networks has received considerable attention in the past few years. A particularly studied setting is the case of a single server (e.g., a base station) and multiple users, each of which caches segments of files in a finite library. Each user requests one (whole) file in the library and the server sends a common coded multicast message to satisfy all users at once. The problem consists of finding the smallest possible codeword length to satisfy such requests. In this paper we consider the generalization to the case where each user places L ≥ 1 requests. The obvious naive scheme consists of applying L times the order-optimal scheme for a single request, obtaining a linear in L scaling of the multicast codeword length. We propose a new achievable scheme based on multiple groupcast index coding that achieves a significant gain over the naive scheme. Furthermore, through an information theoretic converse we find that the proposed scheme is approximately optimal within a constant factor of (at most) 18.

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

[2]  Alexandros G. Dimakis,et al.  Local graph coloring and index coding , 2013, 2013 IEEE International Symposium on Information Theory.

[3]  Urs Niesen,et al.  Fundamental Limits of Caching , 2014, IEEE Trans. Inf. Theory.

[4]  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).

[5]  Jaime Llorca,et al.  Network-coded caching-aided multicast for efficient content delivery , 2013, 2013 IEEE International Conference on Communications (ICC).

[6]  Giuseppe Caire,et al.  Wireless Device-to-Device Caching Networks: Basic Principles and System Performance , 2013, IEEE Journal on Selected Areas in Communications.

[7]  Giuseppe Caire,et al.  The Throughput-Outage Tradeoff of Wireless One-Hop Caching Networks , 2013, IEEE Transactions on Information Theory.

[8]  Giuseppe Caire,et al.  Fundamental limits of distributed caching in D2D wireless networks , 2013, 2013 IEEE Information Theory Workshop (ITW).

[9]  Michael Langberg,et al.  On linear index coding for random graphs , 2011, 2012 IEEE International Symposium on Information Theory Proceedings.

[10]  Alexandros G. Dimakis,et al.  Femtocaching and device-to-device collaboration: A new architecture for wireless video distribution , 2012, IEEE Communications Magazine.

[11]  Aaron B. Wagner,et al.  General index coding with side information: Three decoder case , 2013, 2013 IEEE International Symposium on Information Theory.

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