Minimum cost content distribution using network coding: Replication vs. coding at the source nodes

dc.contributor.author Huang, Shurui
dc.contributor.author Ramamoorthy, Aditya
dc.contributor.author Ramamoorthy, Aditya
dc.contributor.author Médard, Muriel
dc.contributor.department Electrical and Computer Engineering
dc.date 2018-02-18T08:22:06.000
dc.date.accessioned 2020-06-30T02:01:34Z
dc.date.available 2020-06-30T02:01:34Z
dc.date.copyright Fri Jan 01 00:00:00 UTC 2010
dc.date.embargo 2017-04-04
dc.date.issued 2010-07-08
dc.description.abstract <p>Abstract: Consider a large file that needs to be multicast over a network to a given set of terminals. Storing the file at a single server may result in server overload. Accordingly, there are distributed storage solutions that operate by dividing the file into pieces and placing copies of the pieces (replication) or coded versions of the pieces (coding) at multiple source nodes. Suppose that the cost of a given network coding based solution to this problem is defined as the sum of the storage cost and the cost of the flows required to support the multicast. In this work, we consider a network with a set of source nodes that can either contain subsets or coded versions of the pieces of the file and are interested in finding the storage capacities and flows at minimum cost. We provide succinct formulations of the corresponding optimization problems by using 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 two cases. Algorithms for determining the content of the source nodes are also provided.</p>
dc.description.comments <p>This is a manuscript of a proceeding from the <em>IEEE Information Theory Workshop on Information Theory </em>(2010), doi:<a href="http://dx.doi.org/10.1109/ITWKSPS.2010.5503149" target="_blank">10.1109/ITWKSPS.2010.5503149</a>. Posted with permission.</p>
dc.format.mimetype application/pdf
dc.identifier archive/lib.dr.iastate.edu/ece_conf/40/
dc.identifier.articleid 1034
dc.identifier.contextkey 9972626
dc.identifier.s3bucket isulib-bepress-aws-west
dc.identifier.submissionpath ece_conf/40
dc.identifier.uri https://dr.lib.iastate.edu/handle/20.500.12876/20862
dc.language.iso en
dc.source.bitstream archive/lib.dr.iastate.edu/ece_conf/40/2010_Ramamoorthy_MinimumCost.pdf|||Sat Jan 15 00:07:22 UTC 2022
dc.source.uri 10.1109/ITWKSPS.2010.5503149
dc.subject.disciplines Systems and Communications
dc.title Minimum cost content distribution using network coding: Replication vs. coding at the source nodes
dc.type article
dc.type.genre conference
dspace.entity.type Publication
relation.isAuthorOfPublication 8f4839bd-bc09-45dd-863a-1157465ec37a
relation.isOrgUnitOfPublication a75a044c-d11e-44cd-af4f-dab1d83339ff
File
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
2010_Ramamoorthy_MinimumCost.pdf
Size:
648.49 KB
Format:
Adobe Portable Document Format
Description: