Minimum Cost Mirror Sites Using Network Coding: Replication versus Coding at the Source Nodes
Name
Medard_Minimum cost mirror.pdf
Size
430.59 KB
Format
Adobe PDF
Checksum (MD5)
221b2bb10905ef8e796b4f0700ac7242
Author(s)
Medard, Muriel
Huang, Shurui
Ramamoorthy, Aditya
Date Issued
February 2011
Journal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Huang, Shurui, Aditya Ramamoorthy, and Muriel Medard. “Minimum Cost Mirror Sites Using Network Coding: Replication Versus Coding at the Source Nodes.” IEEE Transactions on Information Theory 57.2 (2011): 1080–1091.
Version
Author's final manuscript
Abstract
Content distribution over networks is often achieved by using mirror sites that hold copies of files or portions thereof to avoid congestion and delay issues arising from excessive demands to a single location. Accordingly, there are distributed storage solutions that divide the file into pieces and place copies of the pieces (replication) or coded versions of the pieces (coding) at multiple source nodes. We consider a network which uses network coding for multicasting the file. There is a set of source nodes that contains either subsets or coded versions of the pieces of the file. The cost of a given storage solution is defined as the sum of the storage cost and the cost of the flows required to support the multicast. Our interest is in finding the storage capacities and flows at minimum combined cost. We formulate the corresponding optimization problems by using the theory of information measures. In particular, we show that when there are two source nodes, there is no loss in considering subset sources. For three source nodes, we derive a tight upper bound on the cost gap between the coded and uncoded cases. We also present algorithms for determining the content of the source nodes.
Description
September 27, 2010
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/tit.2010.2094890
