pith. sign in

arxiv: 1807.00220 · v1 · pith:YDWB2KCGnew · submitted 2018-06-30 · 💻 cs.DC · cs.IT· math.IT

Storage-Repair Bandwidth Trade-off for Wireless Caching with Partial Failure and Broadcast Repair

classification 💻 cs.DC cs.ITmath.IT
keywords cacherepairbroadcastfailednodesbandwidthsurvivingwireless
0
0 comments X
read the original abstract

Repair of multiple partially failed cache nodes is studied in a distributed wireless content caching system, where $r$ out of a total of $n$ cache nodes lose part of their cached data. Broadcast repair of failed cache contents at the network edge is studied; that is, the surviving cache nodes transmit broadcast messages to the failed ones, which are then used, together with the surviving data in their local cache memories, to recover the lost content. The trade-off between the storage capacity and the repair bandwidth is derived. It is shown that utilizing the broadcast nature of the wireless medium and the surviving cache contents at partially failed nodes significantly reduces the required repair bandwidth per node.

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.