Computer Science – Information Theory
Scientific paper
2009-10-12
Computer Science
Information Theory
IEEE Trans. on Information Theory (to appear), 2010
Scientific paper
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.
Huang Shurui
Medard Muriel
Ramamoorthy Aditya
No associations
LandOfFree
Minimum cost mirror sites using network coding: Replication vs. coding at the source nodes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Minimum cost mirror sites using network coding: Replication vs. coding at the source nodes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum cost mirror sites using network coding: Replication vs. coding at the source nodes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-639794