Optimal content delivery with network coding

Leong, Derek; Ho, Tracey; Cathey, Rebecca

doi:10.1109/ciss.2009.5054756

Cited by 11 publications

(4 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, the objective adopted in [19] and [20] is to minimize the total storage budget required to satisfy a given set of deterministic recovery requirements in a network. Incidentally, the use of network coding makes it easier to deal with the total cost of content delivery, which covers the initial dissemination, storage, and eventual fetching of data objects; this cost-minimization problem is considered in [6] and [21], subject to various deterministic constraints involving, for example, load balancing or fetching distance.…”

Section: Other Related Workmentioning

confidence: 99%

Distributed Storage Allocations

Leong

Dimakis

2012

IEEE Trans. Inform. Theory

Self Cite

102

View full text Add to dashboard Cite

We examine the problem of allocating a given total storage budget in a distributed storage system for maximum reliability. A source has a single data object that is to be coded and stored over a set of storage nodes; it is allowed to store any amount of coded data in each node, as long as the total amount of storage used does not exceed the given budget. A data collector subsequently attempts to recover the original data object by accessing only the data stored in a random subset of the nodes. By using an appropriate code, successful recovery can be achieved whenever the total amount of data accessed is at least the size of the original data object. The goal is to find an optimal storage allocation that maximizes the probability of successful recovery. This optimization problem is challenging in general because of its combinatorial nature, despite its simple formulation. We study several variations of the problem, assuming different allocation models and access models. The optimal allocation and the optimal symmetric allocation (in which all nonempty nodes store the same amount of data) are determined for a variety of cases. Our results indicate that the optimal allocations often have nonintuitive structure and are difficult to specify. We also show that depending on the circumstances, coding may or may not be beneficial for reliable storage.Comment: Extended version of a journal paper in the IEEE Transactions on Information Theory. 21 pages, 10 figures, 3 table

show abstract

Section: Other Related Workmentioning

confidence: 99%

Distributed Storage Allocations

Leong

Dimakis

2012

IEEE Trans. Inform. Theory

Self Cite

102

View full text Add to dashboard Cite

show abstract

“…Furthermore, they described a TCP-based streaming protocol by using network coding technique. Reference [28] proposed a unified linear program formulation to optimally deliver content through CDN. They takes into accounts various costs and constraints, that is, dissemination cost, storage cost, and fetch cost.…”

Section: Related Workmentioning

confidence: 99%

Exploring Coding Benefits in CDN-Based VoD Systems

Zhou

Zhang

2014

IEEE Trans. Circuits Syst. Video Technol.

View full text Add to dashboard Cite

Currently, video-on-demand (VoD) streaming over Internet is a popular application. Because of the rapidly growing video population and user population, how to maintain high user quality of experience (QoE) with low cost is a challenging problem for Internet video streaming providers. A promising technique to potentially benefit VoD streaming system is network coding. A number of recent works studied how to use network coding to simplify chunk scheduling strategy to enhance VoD streaming performance. Most of these works only covered extreme cases of pure coding or pure chunk scheduling, emphasizing implementation, and experimentation in peer-to-peer (P2P) scenario without analytically evaluating the realizable performance gains explicitly. In this paper we discuss the strength and weakness of a family of coding strategies for CDN-based VoD streaming systems. The coding schemes are characterized by block sizes while the chunk scheduling strategy is characterized by the order to download chunks. Both pure coding strategy and pure chunk scheduling strategy are special cases of this family of strategies. We then propose a model to evaluate the benefits brought by each strategy. Basically, the coding scheme with larger block size gives more streaming and scheduling benefits with the cost of heavier overheads (e.g., encoding and decoding). System designers can take advantage of our model to balance the tradeoff between coding gain and coding overheads.Index Terms-Chunk scheduling, network coding, video-ondemand (VoD) streaming.

show abstract

“…Wu et al [25] studied network coding in Content Centric Networks (CCN) which is an implementation of ICN. Leong et al [19] proposed a linear programming formulation to deliver contents optimally in today's IP based Content Delivery Networks (CDN) using network coding. Llorca et at.…”

Section: Related Workmentioning

confidence: 99%

Multihop Caching-Aided Coded Multicasting for the Next Generation of Cellular Networks

Kiskani,

Sadjadpour

2014

Preprint

View full text Add to dashboard Cite

Next generation of cellular networks deploying wireless distributed femtocaching infrastructure proposed by Golrezaei et. al. are studied. By taking advantage of multihop communications in each cell, the number of required femtocaching helpers is significantly reduced. This reduction is achieved by using the underutilized storage and communication capabilities in the User Terminals (UTs), which results in reducing the deployment costs of distributed femtocaches.A multihop index coding technique is proposed to code the cached contents in helpers to achieve order optimal capacity gains. As an example, we consider a wireless cellular system in which contents have a popularity distribution and demonstrate that our approach can replace many unicast communications with multicast communication. We will prove that simple heuristic linear index code algorithms based on graph coloring can achieve order optimal capacity under Zipfian content popularity distribution.

show abstract

Optimal content delivery with network coding

Cited by 11 publications

References 22 publications

Distributed Storage Allocations

Distributed Storage Allocations

Exploring Coding Benefits in CDN-Based VoD Systems

Multihop Caching-Aided Coded Multicasting for the Next Generation of Cellular Networks

Contact Info

Product

Resources

About