Growing half-balls: Minimizing storage and communication costs in CDNs

Reuven Bar-Yehuda; Erez Kantor; Shay Kutten; Dror Rawitz

doi:10.1007/978-3-642-31585-5-38

Growing half-balls: Minimizing storage and communication costs in CDNs

Reuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz

Bar-Ilan University, Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

The Dynamic Content Distribution problem addresses the trade-off between storage and delivery costs in modern virtual Content Delivery Networks (CDNs). That is, a video file can be stored in multiple places so that the request of each user is served from a location that is near by to the user. This minimizes the delivery costs, but is associated with a storage cost. This problem is NP-hard even in grid networks. In this paper, we present a constant factor approximation algorithm for grid networks. We also present an O(logδ)-competitive algorithm, where δ is the normalized diameter of the network, for general networks with general metrics. We show a matching lower bound by using a reduction from online undirected Steiner tree. Our algorithms use a rather intuitive approach that has an elegant representation in geometric terms. © 2012 Springer-Verlag Berlin Heidelberg.

Original language	English
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7392 LNCS
Issue number	PART 2
DOIs	https://doi.org/10.1007/978-3-642-31585-5-38
State	Published - 1 Jan 2012

Access to Document

10.1007/978-3-642-31585-5-38

Cite this

@article{fb943c8a108a4d3ea0f9d4aef6c10a3e,

title = "Growing half-balls: Minimizing storage and communication costs in CDNs",

abstract = "The Dynamic Content Distribution problem addresses the trade-off between storage and delivery costs in modern virtual Content Delivery Networks (CDNs). That is, a video file can be stored in multiple places so that the request of each user is served from a location that is near by to the user. This minimizes the delivery costs, but is associated with a storage cost. This problem is NP-hard even in grid networks. In this paper, we present a constant factor approximation algorithm for grid networks. We also present an O(logδ)-competitive algorithm, where δ is the normalized diameter of the network, for general networks with general metrics. We show a matching lower bound by using a reduction from online undirected Steiner tree. Our algorithms use a rather intuitive approach that has an elegant representation in geometric terms. {\textcopyright} 2012 Springer-Verlag Berlin Heidelberg.",

author = "Reuven Bar-Yehuda and Erez Kantor and Shay Kutten and Dror Rawitz",

year = "2012",

month = jan,

day = "1",

doi = "10.1007/978-3-642-31585-5-38",

language = "الإنجليزيّة",

volume = "7392 LNCS",

number = "PART 2",

}

Growing half-balls: Minimizing storage and communication costs in CDNs. / Bar-Yehuda, Reuven; Kantor, Erez; Kutten, Shay et al.
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 7392 LNCS, No. PART 2, 01.01.2012.

Research output: Contribution to journal › Article › peer-review

TY - JOUR

T1 - Growing half-balls: Minimizing storage and communication costs in CDNs

AU - Bar-Yehuda, Reuven

AU - Kantor, Erez

AU - Kutten, Shay

AU - Rawitz, Dror

PY - 2012/1/1

Y1 - 2012/1/1

N2 - The Dynamic Content Distribution problem addresses the trade-off between storage and delivery costs in modern virtual Content Delivery Networks (CDNs). That is, a video file can be stored in multiple places so that the request of each user is served from a location that is near by to the user. This minimizes the delivery costs, but is associated with a storage cost. This problem is NP-hard even in grid networks. In this paper, we present a constant factor approximation algorithm for grid networks. We also present an O(logδ)-competitive algorithm, where δ is the normalized diameter of the network, for general networks with general metrics. We show a matching lower bound by using a reduction from online undirected Steiner tree. Our algorithms use a rather intuitive approach that has an elegant representation in geometric terms. © 2012 Springer-Verlag Berlin Heidelberg.

AB - The Dynamic Content Distribution problem addresses the trade-off between storage and delivery costs in modern virtual Content Delivery Networks (CDNs). That is, a video file can be stored in multiple places so that the request of each user is served from a location that is near by to the user. This minimizes the delivery costs, but is associated with a storage cost. This problem is NP-hard even in grid networks. In this paper, we present a constant factor approximation algorithm for grid networks. We also present an O(logδ)-competitive algorithm, where δ is the normalized diameter of the network, for general networks with general metrics. We show a matching lower bound by using a reduction from online undirected Steiner tree. Our algorithms use a rather intuitive approach that has an elegant representation in geometric terms. © 2012 Springer-Verlag Berlin Heidelberg.

UR - http://www.scopus.com/inward/record.url?scp=84884195029&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-31585-5-38

DO - 10.1007/978-3-642-31585-5-38

M3 - مقالة

VL - 7392 LNCS

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

IS - PART 2

ER -

Growing half-balls: Minimizing storage and communication costs in CDNs

Abstract

Access to Document

Other files and links

Fingerprint

Cite this