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

Authors:
Reuven Bar-Yehuda;Erez Kantor;Shay Kutten;Dror Rawitz
Affiliations:
Technion, Haifa, Israel;Technion, Haifa, Israel;Technion, Haifa, Israel;Tel-Aviv University, Tel-Aviv, Israel
Venue:
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Year:
2012

Citing 10
Cited 0

Competitive algorithms for distributed data management (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Competitive distributed file allocation

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
The dynamic servers problem

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Comparative Models of the File Assignment Problem

ACM Computing Surveys (CSUR)
Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem

Journal of Global Optimization
Optimal allocation of electronic content

Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal Information Delivery

ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
On bandwidth and storage tradeoffs in multimedia distribution networks

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Multimedia information caching for personalized video-on-demand

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

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.