Pith

open record

sign in

arxiv: 2106.06635 · v1 · pith:RU3Z7HLK · submitted 2021-06-11 · cs.IT · math.IT

On D2D Caching with Uncoded Cache Placement

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:RU3Z7HLKrecord.jsonopen to challenge →

classification cs.IT math.IT
keywords cachesdevicesminimumphaseplacementserveruncodedassume
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.