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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

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.

Original language	English
Title of host publication	Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings
Publisher	Springer Verlag
Pages	416-427
Number of pages	12
Edition	PART 2
ISBN (Print)	9783642315848
DOIs	https://doi.org/10.1007/978-3-642-31585-5_38
State	Published - 2012
Externally published	Yes
Event	39th International Colloquium on Automata, Languages, and Programming, ICALP 2012 - Warwick, United Kingdom Duration: 9 Jul 2012 → 13 Jul 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 2
Volume	7392 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	39th International Colloquium on Automata, Languages, and Programming, ICALP 2012
Country/Territory	United Kingdom
City	Warwick
Period	9/07/12 → 13/07/12

Bibliographical note

Funding Information:
Supported in part by the Net-HD MAGNET Consortium.

Funding

Supported in part by the Net-HD MAGNET Consortium.

Access to Document

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

Cite this

Bar-Yehuda, R., Kantor, E., Kutten, S., & Rawitz, D. (2012). Growing half-balls: Minimizing storage and communication costs in CDNs. In Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings (PART 2 ed., pp. 416-427). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7392 LNCS, No. PART 2). Springer Verlag. https://doi.org/10.1007/978-3-642-31585-5_38

Bar-Yehuda, Reuven ; Kantor, Erez ; Kutten, Shay et al. / Growing half-balls : Minimizing storage and communication costs in CDNs. Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings. PART 2. ed. Springer Verlag, 2012. pp. 416-427 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).

@inproceedings{7342d9927f01440a9987e63f6bc6618b,

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.",

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

note = "Funding Information: Supported in part by the Net-HD MAGNET Consortium.; 39th International Colloquium on Automata, Languages, and Programming, ICALP 2012 ; Conference date: 09-07-2012 Through 13-07-2012",

year = "2012",

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

language = "אנגלית",

isbn = "9783642315848",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

number = "PART 2",

pages = "416--427",

booktitle = "Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings",

address = "גרמניה",

edition = "PART 2",

}

Bar-Yehuda, R, Kantor, E, Kutten, S & Rawitz, D 2012, Growing half-balls: Minimizing storage and communication costs in CDNs. in Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 7392 LNCS, Springer Verlag, pp. 416-427, 39th International Colloquium on Automata, Languages, and Programming, ICALP 2012, Warwick, United Kingdom, 9/07/12. https://doi.org/10.1007/978-3-642-31585-5_38

Growing half-balls: Minimizing storage and communication costs in CDNs. / Bar-Yehuda, Reuven; Kantor, Erez; Kutten, Shay et al.
Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings. PART 2. ed. Springer Verlag, 2012. p. 416-427 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7392 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Growing half-balls

T2 - 39th International Colloquium on Automata, Languages, and Programming, ICALP 2012

AU - Bar-Yehuda, Reuven

AU - Kantor, Erez

AU - Kutten, Shay

AU - Rawitz, Dror

N1 - Funding Information: Supported in part by the Net-HD MAGNET Consortium.

PY - 2012

Y1 - 2012

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.

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.

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 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84884195029

SN - 9783642315848

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

SP - 416

EP - 427

BT - Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings

PB - Springer Verlag

Y2 - 9 July 2012 through 13 July 2012

ER -

Bar-Yehuda R, Kantor E, Kutten S, Rawitz D. Growing half-balls: Minimizing storage and communication costs in CDNs. In Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings. PART 2 ed. Springer Verlag. 2012. p. 416-427. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). doi: 10.1007/978-3-642-31585-5_38

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

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this