Algorithms for optimizing the bandwidth cost of content delivery

Computer Networks

Volumn 55, Issue 18, 2011, Pages 4007-4020

  Adler, Micah ^c   Sitaraman, Ramesh K ^a   Venkataramani, Harish ^b  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b GOOGLE INC   (United States)

^c Fiksu Inc   (United States)

Author keywords

Bandwidth cost minimization; Content Delivery Networks; Internet content delivery; Network algorithms; Optimization algorithms; Traffic management algorithms

Indexed keywords

CONTENT DELIVERY NETWORK; COST MINIMIZATION; INTERNET CONTENT DELIVERY; NETWORK ALGORITHMS; OPTIMIZATION ALGORITHMS; TRAFFIC MANAGEMENT ALGORITHMS;

ALGORITHMS; BANDWIDTH; INTERNET SERVICE PROVIDERS; OPTIMIZATION; SATELLITE COMMUNICATION SYSTEMS; TELECOMMUNICATION NETWORKS; USER INTERFACES; WEB SERVICES;

COSTS;

EID: 80055017711     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2011.07.015     Document Type: Article

References (24)

1. J. Dilley, B. Maggs, J. Parikh, H. Prokop, R. Sitaraman, and B. Weihl Globally distributed content delivery IEEE Internet Computing 2002 50 58 (Pubitemid 35327445)
2. A. Akella, B. Maggs, S. Seshan, A. Shaikh, R. Sitaraman, A measurement-based analysis of multihoming, in: Proceedings of the 2003 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), August 2003.
3. Limelight. .
4. Akamai. .
5. A.B. Assmann, D.J. Johnson, D.J. Kleitman, and J.Y.-T. Leung On a dual version of the one-dimensional bin packing problem Journal of Algorithms 5 4 1984 502 525
6. D.R. Dooly, S.A. Goldman, and S.D. Scott TCP dynamic acknowledgment delay: theory and practice Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), New York, 23-26, 1998 1998 ACM Press 389 398
7. R. Fleischer On the Bahncard problem Theoretical Computer Science 268 1 2001 161 174 (Pubitemid 32866941)
8. A.R. Karlin, C. Kenyon, D. Randall, Dynamic TCP acknowledgment and other stories about e/(e - 1), in: ACM Symposium on Theory of Computing, 2001, pp. 502-509. (Pubitemid 32865766)
9. A.R. Karlin, M.S. Manasse, L. Rudolph, and D. Sleator Competitive snoopy caching Algorithmica 3 1 1988 70 119
10. E. Nygren, R.K. Sitaraman, and J. Sun The Akamai network: a platform for high-performance Internet applications ACM SIGOPS Operating Systems Review 44 3 2010
11. D.D. Sleator, and R.E. Tarjan Amortized efficiency of list update and paging rules Communications of the ACM 28 2 1985 202 208
12. A. Borodin, and R. El-Yaniv Online Computation and Competitive Analysis 1998 Cambridge University Press
13. D.K. Goldenberg, L. Qiu, H. Xie, Y.R. Yang, Y. Zhang, Optimizing cost and performance for multihoming, in: ACM SIGCOMM, Portland, Oregon, 2004.
14. M. Adler, R. Sitaraman, H. Venkataramani, Algorithms for optimizing bandwidth costs on the Internet, in: 1st IEEE Workshop on Hot Topics in Web Systems and Technologies (HOTWEB), 2006, pp. 1-9.
15. Iljitsch Van Beijnum, BGP. O'Reilly Media, 2002.
16. R. Buyya, M. Pathan, and A. Vakali Content Delivery Networks 2008 Springer-Verlag Germany
17. G. Pallis, and A. Vakali Insight and perspectives for content delivery networks Communications of the ACM 49 1 2006 101 106
18. Gnutella. .
19. KaZaa. .
20. Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan Chord: a scalable peer-to-peer lookup service for internet applications Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications ACM SIGCOMM Computer Communication Review 31 4 2001
21. Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Schenker A scalable content-addressable network Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications ACM SIGCOMM Computer Communication Review 31 4 2001
22. Ben Y. Zhao, Ling Huang, Jeremy Stribling, Sean C. Rhea, Anthony D. Joseph, and John Kubiatowicz Tapestry: a resilient global-scale overlay for service deployment IEEE Journal on Selected Areas in Communications 22 1 2004
23. A. Rowstron, P. Druschel, Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems, in: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, November, 2001, pp. 329-350. (Pubitemid 33362020)
24. R. Buyya, A.M.K. Pathan, J. Broberg, and Z. Tari A case for peering of content delivery networks IEEE Distributed Systems Online 7 10 2006