Algorithms for optimizing bandwidth costs on the internet

2006 1st IEEE Workshop on Hot Topics in Web Systems and Technologies, HotWeb

Volumn , Issue , 2006, Pages

  Adler, Micah ^a   Sitaraman, Ramesh ^a   Venkataramani, Harish ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTER SYSTEMS; CONTRACTS; INFORMATION SERVICES; INTERNET SERVICE PROVIDERS; TECHNOLOGY; TELECOMMUNICATION SYSTEMS; WORLD WIDE WEB;

BANDWIDTH USAGE; CONTENT DELIVERY NETWORKS; COST MINIMIZATION; DATA CENTERS; END-USERS; INTERNET ACCESS; MULTI-HOMING; ROUTING TRAFFIC; WEB CONTENTS; WEB SERVERS; WEB SYSTEMS;

INTERNET;

EID: 50049128978     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HOTWEB.2006.355262     Document Type: Conference Paper

References (15)

1. J. Dilley, B. Maggs, J. Parikh, H. Prokop, R. Sitaraman, and B. Weihl. Globally distributed content delivery. IEEE Internet Computing, September 2002, pp. 50-58.
2. A. Akella, B. Maggs, S. Seshan, A. Shaikh, and R. Sitaraman. A Measurement-Based Analysis of Multihoming. Proceedings of the 2003 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), August 2003.
3. Routescience. http://www.routescience.com.
4. Internap: Premise-based Route Optimization. http://www.internap.com/ products/route-optimization.htm.
5. Limelight. http://www.limelightnetworks.com.
6. Akamai. http://www.akamai.com.
7. 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):502-525, 1984.
8. D. R. Dooly, S. A. Goldman, and S. D. Scott. TCP dynamic acknowledgment delay: Theory and practice. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 389-398, New York, 23-26 1998. ACM Press.
9. R. Fleischer. On the Bahncard problem. Theoretical Computer Science, 268(1): 161-174, 2001.
10. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP- Completeness. W.H. Freeman, 1979.
11. A. R. Karlin, C. Kenyon, and D. Randall. Dynamic TCP acknowledgment and other stories about e/(e-l). In ACM Symposium on Theory of Computing, pages 502-509, 2001.
12. A. R. Karlin, M. S. Manasse, L. Rudolph, and D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):70-119, 1988.
13. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Commun. ACM, 28(2):202-208, 1985.
14. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
15. D.K. Goldenberg, L. Qiu, H. Xie, Y. R. Yang, and Y. Zhang. Optimizing Cost and Performance for Multihoming. ACM SIGCOMM, Portland, Oregon, 2004.