Efficient File Delivery for Coded Prefetching in Shared Cache Networks with Multiple Requests Per User
Haisheng Xu, Chen Gong, Xiaodong Wang

TL;DR
This paper introduces an efficient file delivery scheme for shared cache networks with multiple user requests, improving delivery rates by classifying coded packets and employing a staged delivery strategy.
Contribution
It presents a novel delivery scheme with explicit constructions that handles arbitrary multi-requests and unifies existing coded caching schemes.
Findings
Achieves lower delivery rates compared to existing methods.
Provides explicit construction and analysis of delivery rate.
Numerical results demonstrate improved performance.
Abstract
We consider a centralized caching network, where a server serves several groups of users, each having a common shared homogeneous fixed-size cache and requesting arbitrary multiple files. An existing coded prefetching scheme is employed where each file is broken into multiple fragments and each cache stores multiple coded packets each formed by XORing fragments from different files. For such a system, we propose an efficient file delivery scheme with explicit constructions by the server to meet the arbitrary multi-requests of all user-groups. Specifically, the stored coded packets of each cache are classified into four types based on the composition of the file fragments encoded. A delivery strategy is developed, which separately delivers part of each packet type first and then combinatorially delivers the remaining different packet types in the last stage. The rate as well as the worst…
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 · Opportunistic and Delay-Tolerant Networks · Cooperative Communication and Network Coding
