Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs

  • Reuven Bar-Yehuda
  • Erez Kantor
  • Shay Kutten
  • Dror Rawitz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7392)

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.

Keywords

Communication Cost Steiner Tree Competitive Ratio Steiner Tree Problem Horizontal Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Net-HD Consortium, http://www.nethd.org.il
  2. 2.
    Cisco visual networking index: Usage study. Cisco Visual Networking Index (October 25, 2010), http://www.cisco.com/en/US/solutions/collateral/ns341/ns525/ns537/ns705/Cisco_VNI_Usage_WP.html
  3. 3.
    Hyperconnectivity and the approaching zettabyte era. Cisco Visual Networking Index (June 2, 2010), http://www.cisco.com/en/US/solutions/~collateral/ns341/ns525/ns537/ns705/~ns827/VNI_Hyperconnectivity_WP.html
  4. 4.
    Abell, J.C.: Netflix instant account for 20 percent of peek U.S. bandwidth use. Wire Magazine (October 21, 2010)Google Scholar
  5. 5.
    Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. Journal of the ACM 45(5), 753–782 (1998)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Awerbuch, B., Bartal, Y., Fiat, A.: Competitive distributed file allocation. In: 25th ACM STOC, pp. 164–173 (1993)Google Scholar
  7. 7.
    Bartal, Y., Fiat, A., Rabani, Y.: Competitive algorithms for distributed data management. In: 24th ACM STOC, pp. 39–50 (1992)Google Scholar
  8. 8.
    Black, D., Sleator, D.: Competitive algorithms for replication and migration problems. Tech. Rep. CMU-CS-89-201, CMU (1989)Google Scholar
  9. 9.
    Charlikar, M., Halperin, D., Motwani, R.: The dynamic servers problem. In: 9th Annual Symposium on Discrete Algorithms, pp. 410–419 (1998)Google Scholar
  10. 10.
    Cidon, I., Kutten, S., Soffer, R.: Optimal allocation of electronic content. Computer Networks 40(2), 205–218 (2002)CrossRefGoogle Scholar
  11. 11.
    Dowdy, L.W., Foster, D.V.: Comparative models of the file assignment problem. ACM Comp. Surveys 14(2), 287–313 (1982)CrossRefGoogle Scholar
  12. 12.
    Garey, M.R., Graham, R.L., Johnson, D.S.: The complexity of computing steiner minimal trees. SIAM J. on Applied Math. 32(4), 835–859 (1977)MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Hwang, F.K., Richards, D.S.: Steiner tree problems. Networks 22(1), 55–89 (1992)MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    Jones, D.: Proof that telstra is throtteling youtube bandwidth in australia, http://www.eevblog.com, http://www.youtube.com/watch?v=9iDRynyBl0c
  15. 15.
    Kopytoff, V.G.: Shifting online, Netflix faces new competition. New York Times (Business Day, Technology) (September 26, 2010)Google Scholar
  16. 16.
    Papadimitriou, C., Ramanathan, S., Rangan, P.: Information caching for delivery of personalized video programs for home entertainment channels. In: IEEE International Conf. on Multimedia Computing and Systems, pp. 214–223 (1994)Google Scholar
  17. 17.
    Papadimitriou, C., Ramanathan, S., Rangan, P.: Optimal Information Delivery. In: Staples, J., Katoh, N., Eades, P., Moffat, A. (eds.) ISAAC 1995. LNCS, vol. 1004, pp. 181–187. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  18. 18.
    Papadimitriou, C., Ramanathan, S., Rangan, P., Sampathkumar, S.: Multimedia information caching for personalized video-on demand. Computer Communications 18(3), 204–216 (1995)CrossRefGoogle Scholar
  19. 19.
    Schaffa, F., Nussbaumer, J.P.: On bandwidth and storage tradeoffs in multimedia distribution networks. In: IEEE INFOCOM, pp. 1020–1026 (1995)Google Scholar
  20. 20.
    Xiuzhen Cheng, B.D., Lu, B.: Polynomial time approximation scheme for symmetric rectilinear steiner arborescence problem. J. Global Optim. 21, 385–396 (2001)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Reuven Bar-Yehuda
    • 1
  • Erez Kantor
    • 1
  • Shay Kutten
    • 1
  • Dror Rawitz
    • 2
  1. 1.TechnionHaifaIsrael
  2. 2.Tel-Aviv UniversityTel-AvivIsrael

Personalised recommendations