Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding

Conference

2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo)

Publication Version

Accepted Manuscript

Link to Published Version

https://doi.org/10.1109/ITWKSPS.2010.5503149

Publication Date

7-8-2010

Journal or Book Title

2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo)

DOI

10.1109/ITWKSPS.2010.5503149

Conference Title

2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo)

Conference Date

January 6-8, 2010

City

Cairo, Egypt

Abstract

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.

Comments

This is a manuscript of a proceeding from the IEEE Information Theory Workshop on Information Theory (2010), doi:10.1109/ITWKSPS.2010.5503149. Posted with permission.

Rights

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Copyright Owner

IEEE

Language

en

File Format

application/pdf

Published Version

Share

Article Location

 
COinS