Updating Content in Cache-Aided Coded Multicast
Name
1805.00396.pdf
Description
Accepted version
Size
1.97 MB
Format
Unknown
Checksum (MD5)
085d2ee9caaf8ef201a1c8e77fe1ae76
Author(s)
Mahdian, Milad
Prakash, N.
Medard, Muriel
Yeh, Edmund
Date Issued
2018
Journal
IEEE Journal on Selected Areas in Communications
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Version
Author's final manuscript
Abstract
© 2018 IEEE. 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.
MIT Department
Massachusetts Institute of Technology. Research Laboratory of Electronics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/JSAC.2018.2844943
