REVIEW 2 cited by
Improved Hotplug Caching Schemes Using PDAs and t-Designs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We consider a coded caching system in which some users are offline at the time of delivery. Such systems are called hotplug coded caching systems. A placement delivery array (PDA) is a well-known tool for constructing a coded caching scheme for dedicated caches. In this paper, we introduce the concept of PDAs for hotplug coded caching schemes and refer to it as a hotplug placement delivery array (HpPDA). We give an algorithm to describe the placement and the delivery phase of a hotplug coded caching scheme using HpPDA. We show that an existing hotplug coded caching scheme given by Y. Ma and D. Tuninetti in 2022 corresponds to a class of HpPDAs and then propose a method to further improve the rate of that scheme. Additionally, we construct a class of HpPDAs using $t$-designs, which corresponds to a scheme for hotplug coded caching systems. We further improve the rate of this scheme and prove that the cut-set bound is achieved in some higher memory range for a hotplug coded caching system with three active users.
Forward citations
Cited by 2 Pith papers
-
On Hierarchical Coded Caching with Offline Users
A new array construction, HHPDA, extends coded caching with offline users to hierarchical networks where mirrors also have caches.
-
Secretive Hotplug Coded Caching
Two secretive hotplug coded caching schemes are constructed from MAN-HpPDAs and t-design HpPDAs, with better rates than a baseline in certain memory regions.
Discussion (0). Continue with ORCID to comment.