On D2D Caching with Uncoded Cache Placement
\c{C}a\u{g}kan Yapar, Kai Wan, Rafael F. Schaefer, Giuseppe Caire

TL;DR
This paper analyzes a cache-aided D2D wireless network with uncoded cache placement, providing exact load-memory trade-offs for minimizing data transmission loads during one-shot delivery.
Contribution
It offers the first exact characterization of load-memory trade-offs in uncoded cache placement for D2D networks under one-shot delivery constraints.
Findings
Derived exact minimum average load
Derived exact minimum peak load
Characterized load-memory trade-off curve
Abstract
We consider a cache-aided wireless device-to-device (D2D) network under the constraint of one-shot delivery, where the placement phase is orchestrated by a central server. We assume that the devices' caches are filled with uncoded data, and the whole file database at the server is made available in the collection of caches. Following this phase, the files requested by the users are serviced by inter-device multicast communication. For such a system setting, we provide the exact characterization of load-memory trade-off, by deriving both the minimum average and the minimum peak sum-loads of links between devices, for a given individual memory size at disposal of each user.
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 · Advanced Wireless Network Optimization
