.png){kind=icon}
.png){kind=icon}
Return
Updating Content in Cache-Aided Coded Multicast
.png){kind=icon}
OA
AI
DOI：10.1109/JSAC.2018.2844943.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Motivated by applications to delivery of dynamically updated, but correlated data in settings such as content distribution networks, and distributed file sharing systems, we study a single source multiple destination network coded multicast problem in a cache-aided network. We focus on models where the caches are primarily located near the destinations and the source has no cache. The source observes a sequence of correlated frames and is expected to do frame-by-frame encoding with no access to prior frames. We present a novel scheme that shows how the caches can be advantageously used to decrease the overall cost of multicast, even though the source encodes without access to past data. Our cache design and update scheme works with any choice of network code designed for a corresponding cache-less network, is largely decentralized, and works for an arbitrary network. We study a convex relation of the optimization problem that results from the overall cost function. The results of the optimization problem determine the rate allocation and caching strategies. Numerous simulation results are presented to substantiate the theory developed.
Keywords:
Caching networks
distributed systems
file sharing
network coding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
17.2
Papers:
6.4K
Citations:
3.1W