Cache-aided Combination Networks
Sponsors:
Problem Statement and Motivation
- Caching is an effective way to smooth out network traffic in peak times by storing locally content during peak-off times.
- Caching has two phases: placement (limited only by the size of the local cache and designed without knowledge of future demands) and delivery (where the goal is to minimize the number of broadcast transmissions so that every receiver can decode the desired message)
- In this work we studied a network topology where intermediate relays help cache-aided users. We derived novel inner and outer bound, that match for certain channel parameters.
Technical Approach
- We extended tools for the classical shared single bottleneck-link caching problem to networks with a “combination network” topology.
- In addition to known methods, we used coded cache placement and interference-alignment-based delivery.
Key Achievements and Future Goals
- We derived state-of-the-art achievable and converse bounds, which meet for some network parameters.
- Results presented at:
- Kai Wan, Mingyue Ji, Pablo Piantanida, Daniela Tuninetti, “On the Benefits of Asymmetric Coded Cache Placement in Combination Networks with End-User Caches,” Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT 2018).
- Kai Wan, Mingye Ji, Pablo Piantanida and Daniela Tuninetti, “Caching in Combination Networks: Novel Multicast Message Generation and Delivery by Leveraging the Network Topology,” Proceedings of the 2018 IEEE International Conference on Communications (ICC 2018).
- Kai Wan, Daniela Tuninetti, Pablo Piantanida and Mingye Ji, “On Cache-aided Relay Networks,” Proceedings of the 22nd International ITG Workshop on Smart Antennas (WSA 2018).
- Kai Wan, Mingyue Ji, Pablo Piantanida, and Daniela Tuninetti, “A Novel Asymmetric Coded Placement for Combination Networks with End-User Caches,” Proceedings of the 2018 IEEE Information Theory and Applications Workshop (ITA 2018).
- Kai Wan, Mingyue Ji, Pablo Piantanida, and Daniela Tuninetti, “Novel Outer Bounds for Combination Networks with End-User-Caches,” Proceedings of the 2017 IEEE Information Theory Workshop (ITW 2017).
- Kai Wan, Mingyue Ji, Pablo Piantanida, and Daniela Tuninetti, “State-of-the-art in cache- aided combination networks,” Proceedings of the 51st Annual Asilomar Conference on Signals, Systems, and Computers (Asilomar 2017).
- Kai Wan, Mingyue Ji, Pablo Piantanida, and Daniela Tuninetti, “Novel Inner Bounds with Uncoded Cache Placement for Combination Networks with End-User-Caches,”Proceedings of the Fifty-Fifth Annual Allerton Conference on Communication, Control and Computing (Allerton 2017).
