Device-to-Device Coded-Caching With Distinct Cache Sizes

Ibrahim, Abdelrahman M.; Zewail, Ahmed A.; Yener, Aylin

doi:10.1109/tcomm.2020.2970950

Cited by 37 publications

(15 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Depending on the network topology, this coded variant can be a more powerful approach than traditional prefetching, because it employs caching not only to change the volume of the communication problem, but also to change the structure of the problem itself, simply by changing the interference patterns. Coded caching has been rightfully credited with being able to transform memory into data rates, and has hence sparked a flurry of research on a variety of topics such as on the interplay between caching and PHY [11]- [21], caching and privacy [22]- [24], on information-theoretic converses [25], [26], on the critical bottleneck of subpacketization [27]- [31], and a variety of other scenarios [32]- [37].…”

Section: Introductionmentioning

confidence: 99%

Unselfish Coded Caching can Yield Unbounded Gains over Symmetrically Selfish Caching

Brunero,

Elia

2021

Preprint

View full text Add to dashboard Cite

The original coded caching scenario assumes a content library that is of interest to all receiving users. In a realistic scenario though, the users may have diverging interests which may intersect to various degrees. What happens for example if each file is of potential interest to, say, 40 % of the users and each user has potential interest in 40 % of the library? In this work, we investigate the so-called symmetrically selfish coded caching scenario, where each user only makes requests from a subset of the library that defines its own File Demand Set (FDS), each user caches selfishly only contents from its own FDS, and where the different FDSs symmetrically overlap to some extent. In the context of various traditional prefetching scenarios (prior to the emergence of coded caching), selfish approaches were known to be potentially very effective. On the other hand -with the exception of some notable works -little is known about selfish coded caching. We here present a new information-theoretic converse that proves, in a general setting of symmetric FDS structures, that selfish coded caching, despite enjoying a much larger local caching gain and a much smaller set of possible demands, introduces an unbounded load increase compared to the unselfish case. In particular, in the K-user broadcast channel where each user stores a fraction γ of the library, where each file (class) is of interest to α users, and where any one specific file is of interest to a fraction δ of users, the optimal coding gain of symmetrically selfish caching is at least (K − α)γ + 1 times smaller than in the unselfish scenario. This allows us to draw the powerful conclusion that the optimal selfish coding gain is upper bounded by 1/(1 − δ), and thus does not scale with K. These derived limits are shown to be exact for different types of demands.

show abstract

Section: Introductionmentioning

confidence: 99%

Unselfish Coded Caching can Yield Unbounded Gains over Symmetrically Selfish Caching

Brunero,

Elia

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…However, during the peak traffic period, the current best way is to cache the content in MDs, and users can mainly transmit the requested content through D2D. In a cache-enabled MDs system, Ibrahim et al [ 78 ] proposed a coded caching scheme that minimizes the worst-case delivery load for D2D-based content delivery to users with unequal cache sizes. They considered the situation of users with different storage capabilities to minimize the D2D transmission load under poor network conditions.…”

Section: Caching Policiesmentioning

confidence: 99%

A Comprehensive Review on Edge Caching from the Perspective of Total Process: Placement, Policy and Delivery

Fan

Wang

et al. 2021

Sensors

View full text Add to dashboard Cite

With the explosive growth of smart devices and mobile applications, mobile core networks face the challenge of exponential growth in traffic and computing demand. Edge caching is one of the most promising solutions to the problem. The main purpose of edge caching is to place popular content that users need at the edge of the network, borrow free space to reduce user waiting time, and lighten the network load by reducing the amount of duplicate data. Due to the promising advantages of edge caching, there have been many efforts motivated by this topic. In this paper, we have done an extensive survey on the existing work from our own perspectives. Distinguished from the existing review articles, our work not only investigates the latest articles in this area, but more importantly, covers all the researches of the total process of edge caching from caching placement optimization, policy design, to the content delivery process. In particular, we discuss the benefits of caching placement optimization from the perspective of different stakeholders, detail the delivery process, and conduct in-depth discussions from the five phases, i.e., requested content analysis, user model analysis, content retrieval, delivery, and update. Finally, we put forward several challenges and potential future directions, and hope to bring some ideas for the follow-up researches in this area.

show abstract

“…For heterogeneous cache-aided D2D networks where users are equipped with cache memories of distinct sizes, ref. [ 39 ] minimized the delivery load by optimizing over the partition during the placement phase and the size and structure of D2D during the delivery phase. A highly dense wireless network with device mobility was investigated in [ 40 ].…”

Section: Introductionmentioning

confidence: 99%

Coded Caching for Broadcast Networks with User Cooperation

Huang

Chen

You

et al. 2022

Entropy

View full text Add to dashboard Cite

Caching technique is a promising approach to reduce the heavy traffic load and improve user latency experience for the Internet of Things (IoT). In this paper, by exploiting edge cache resources and communication opportunities in device-to-device (D2D) networks and broadcast networks, two novel coded caching schemes are proposed that greatly reduce transmission latency for the centralized and decentralized caching settings, respectively. In addition to the multicast gain, both schemes obtain an additional cooperation gain offered by user cooperation and an additional parallel gain offered by the parallel transmission among the server and users. With a newly established lower bound on the transmission delay, we prove that the centralized coded caching scheme is order-optimal, i.e., achieving a constant multiplicative gap within the minimum transmission delay. The decentralized coded caching scheme is also order-optimal if each user’s cache size is larger than a threshold which approaches zero as the total number of users tends to infinity. Moreover, theoretical analysis shows that to reduce the transmission delay, the number of users sending signals simultaneously should be appropriately chosen according to the user’s cache size, and always letting more users send information in parallel could cause high transmission delay.

show abstract

Device-to-Device Coded-Caching With Distinct Cache Sizes

Cited by 37 publications

References 50 publications

Unselfish Coded Caching can Yield Unbounded Gains over Symmetrically Selfish Caching

Unselfish Coded Caching can Yield Unbounded Gains over Symmetrically Selfish Caching

A Comprehensive Review on Edge Caching from the Perspective of Total Process: Placement, Policy and Delivery

Coded Caching for Broadcast Networks with User Cooperation

Contact Info

Product

Resources

About