Algorithmic nuggets in content delivery

Computer Communication Review

Volumn 45, Issue 3, 2015, Pages 52-66

  Maggs, Bruce M ^a   Sitaraman, Ramesh K ^b  

^a Duke and Akamai   (United Kingdom)

^b Amherst and Akamai   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; INDUSTRIAL RESEARCH;

ALGORITHMIC RESEARCH; COMPLEX NETWORKED SYSTEMS; CONTENT DELIVERY; CONTENT DELIVERY NETWORK; DISTRIBUTED SYSTEMS; OVERLAY ROUTING; PRODUCT REQUIREMENTS; SERVER CLUSTER;

ALGORITHMS;

EID: 84977266006     PISSN: 01464833     EISSN: 19435819     Source Type: Journal    
DOI: 10.1145/2805789.2805800     Document Type: Conference Paper

References (31)

1. iostat - linux man page. http://linux.die.net/man/1/iostat.
2. Atila Abdulkadiroglu, Parag A. Pathak, and Alvin E. Roth. The New York City high school match. American Economic Review, pages 364-367, 2005.
3. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
4. Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Jevan Saks, and Ramesh K. Sitaraman. Algorithms for constructing overlay networks for live streaming. arXiv preprint arXiv:1109.4114, 2011.
5. Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, and Ramesh K. Sitaraman. Designing overlay multicast networks for streaming. In Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 149-158. ACM, 2003.
6. Mourad Baiou and Michel Balinski. Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). Discrete Applied Mathematics, 101(1):1-12, 2000.
7. Burton H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
8. Andrei Broder and Michael Mitzenmacher. Network applications of Bloom filters: A survey. Internet Mathematics, 1(4):485-509, 2004.
9. Fangfei Cheng, Ramesh K. Sitaraman, and Marcelo Torres. End-user mapping: Next generation request routing for content delivery. In Proceedings of the 2015 ACM Conference on SIGCOMM, SIGCOMM '15, 2015.
10. John Dilley, Bruce Maggs, Jay Parikh, Harald Prokop, Ramesh Sitaraman, and Bill Weihl. Globally distributed content delivery. Internet Computing, IEEE, 6(5):50-58, 2002.
11. Li Fan, Pei Cao, Jussara Almeida, and Andrei Z. Broder. Summary cache: Ascalable wide-area Web cache sharing protocol. IEEE/ACM Transactions on Networking (TON), 8(3):281-293, 2000.
12. David Gale and Lloyd S. Shapley. College admissions and the stability of marriage. American Mathematical Monthly, pages 9-15, 1962.
13. Michel Goemans. Load balancing in content delivery networks. IMA Annual Program Year Workshop: Network Management and Design, April 2003.
14. Dan Gusfield and Robert W. Irving. The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge, MA, 1989.
15. Kazuo Iwama and Shuichi Miyazaki. A survey of the stable marriage problem and its variants. In Informatics Education and Research for Knowledge-Circulating Society, 2008. ICKS 2008. International Conference on, pages 131-136. IEEE, 2008.
16. D. Karger, A. Sherman, B. Bogstad, R. Dhanidina, K. Iwamoto, B. Kim, L. Matkins, and Y. Yerushalmi. Web caching with consistent hashing. Computer Networks, 31(11):1203-1213, 1999.
17. David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, and Rina Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 654-663, May 1997.
18. David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, and Rina Panigrahy. U.S. patent number 8, 458, 259: Method and apparatus for distributing requests among a plurality of resources, August 2002.
19. Leonidas Kontothanassis, Ramesh Sitaraman, Joel Wein, Duke Hong, Robert Kleinberg, Brian Mancuso, David Shaw, and Daniel Stodolsky. A transport layer for live streaming in a content delivery network. Proceedings of the IEEE, 92(9):1408-1419, 2004.
20. Leslie Lamport. Paxos made simple. ACM SIGACT News, 32(4):18-25, 2001.
21. Leslie Lamport, Robert Shostak, and Marshall Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):382-401, 1982.
22. Daniel M. Lewin. Consistent hashing and random trees: Algorithms for caching in distributed networks. Master's thesis, Massachusetts Institute of Technology, 1998.
23. Michael Mitzenmacher and Eli Upfal. Probability and computing: Randomized algorithms and probabilistic analysis. Cambridge University Press, 2005.
24. Erik Nygren, Ramesh K. Sitaraman, and Jennifer Sun. The Akamai network: Aplatform for high-performance internet applications. ACM SIGOPS Operating Systems Review, 44(3):2-19, 2010.
25. Diego Ongaro and John Ousterhout. In search of an understandable consensus algorithm. In Proceedings of the USENIX Annual Technical Conference, pages 305-320, 2014.
26. H. Rahul, M. Kasbekar, R. Sitaraman, and A. Berger. Towards realizing the performance and availability benefits of a global overlay network. In Proceedings of the Passive and Active Measurement Conference, 2006.
27. Alvin E. Roth and Elliott Peranson. The redesign of the matching market for American physicians: Some engineering aspects of economic design. Technical report, National Bureau of Economic Research, 1999.
28. Alvin E. Roth, Tayfun Sönmez, and M. Utku Ünver. Kidney exchange. The Quarterly Journal of Economics, pages 457-488, 2004.
29. Alex Rousskov and Duane Wessels. Cache digests. Computer Networks and ISDN Systems, 30(22):2155-2168, 1998.
30. Ramesh K. Sitaraman, Mangesh Kasbekar, Woody Lichtenstein, and Manish Jain. Overlay networks: An Akamai perspective. In Pathan, Sitaraman, and Robinson, editors, Advanced Content Delivery, Streaming, and Cloud Services. John Wiley & Sons, 2014.
31. Donald E. Stokes. Pasteur's Quadrant: Basic Science and Technological Innovation. Brookings Institution Press, 1997.