Coded Caching in a Multi-Server System with Random Topology
Nitish Mital, Deniz Gunduz, Cong Ling

TL;DR
This paper investigates coded caching in a multi-server system with random user-server connections, proposing a joint storage and caching scheme that balances latency and storage efficiency.
Contribution
It introduces a novel joint storage and proactive caching scheme leveraging coded storage across servers and uncoded user caches, analyzing delivery latency in a multi-server setting.
Findings
Successive transmission achieves latency comparable to a single server.
Increasing server storage reduces latency gap.
Redundancy across servers influences delivery performance.
Abstract
Cache-aided content delivery is studied in a multi-server system with servers and users, each equipped with a local cache memory. In the delivery phase, each user connects randomly to any out of servers. Thanks to the availability of multiple servers, which model small base stations with limited storage capacity, user demands can be satisfied with reduced storage capacity at each server and reduced delivery rate per server; however, this also leads to reduced multicasting opportunities compared to a single server serving all the users simultaneously. A joint storage and proactive caching scheme is proposed, which exploits coded storage across the servers, uncoded cache placement at the users, and coded delivery. The delivery \textit{latency} is studied for both \textit{successive} and \textit{simultaneous} transmission from the servers. It is shown that, with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Cooperative Communication and Network Coding · Mobile Ad Hoc Networks
