Advertisement

Replica Placement and Request Routing

  • Magnus Karlsson
Chapter
Part of the Web Information Systems Engineering and Internet Technologies Book Series book series (WISE, volume 2)

Abstract

All content delivery networks must decide where to place its content and how to direct the clients to this content. This chapter provides an overview of state-of-the-art solution approaches in both of these areas. But, instead of giving a detailed description on each of the solutions, we provide a high-level overview and compare the approaches by their impact on the client-perceived performance and cost of the content delivery network. This way, we get a better understanding of the practical implications of applying these algorithms in content delivery networks. We end the chapter with a discussion on some open and interesting research challenges in this area.

Keywords

Replica placement algorithms request routing content delivery networks heuristics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abrams, Marc, Standridge, Charles, Abdulla, Ghaleb, Fox, Edward, and Williams, Stephen (1996). Removal Policies in Network Caches for World-Wide Web Documents. In ACM Conference of the Special Interest Group on Data Communication (SIGCOMM), pages 293–305, Stanford, CA.Google Scholar
  2. Akamai (2005). Akamai. Cambridge, MA, USA. http://www.akamai.com.Google Scholar
  3. Anderson, Eric, Kallahalla, Mahesh, Spence, Susan, Swaminathan, Ram, and Wang, Qian (2005). Ergastulum: quickly finding near-optimal storage system designs. ACM Transactions on Computer Systems.Google Scholar
  4. Andrews, Matthew, Shepherd, Bruce, Srinivasan, Aravind, Winkler, Peter, and Zane, Francis (2002). Clustering and Server Selection using Passive Monitoring. In IEEE Infocom, New York, NY.Google Scholar
  5. Androutsellis-Theotokis, Stephanos and Spinellis, Diomidis (2004). A survey of peer-to-peer content distribution technologies. ACM Computer Surveys, 36(4):335–371.CrossRefGoogle Scholar
  6. Awerbuch, Baruch, Bartal, Yair, and Fiat, Amos (1993). Competitive Distributed File Allocation. In ACM Symposium on Theory of Computing (STOC), pages 164–173, San Diego, CA.Google Scholar
  7. Awerbuch, Baruch, Bartal, Yair, and Fiat, Amos (1998). Distributed Paging for General Networks. Journal of Algorithms, 28(1):67–104.MathSciNetCrossRefzbMATHGoogle Scholar
  8. Baev, Ivan and Rajaraman, Rajmohan (2001). Approximation Algorithms for Data Placement in Arbitrary Networks. In ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), pages 661–670, Washington, D.C.Google Scholar
  9. Balinski, Michel (1965). Integer Programming: Methods, Uses, Computation. Management Science, 12: 253–313.zbMATHMathSciNetGoogle Scholar
  10. Bartal, Yair, Fiat, Amos, and Rabani, Yuval (1992). Competitive Algorithms for Distributed Data Management (Extended Abstract). In ACM Symposium on Theory of Computing (STOC), pages 39–50, Victoria, Canada.Google Scholar
  11. Cao, Pei and Irani, Sandy (1997). Cost-Aware WWW Proxy Caching Algorithms. In USENIX Symposium on Internet Technologies and Systems (USITS), pages 193–206, Monterey, CA.Google Scholar
  12. Chase, Jeffrey, Anderson, Darrell, Thakar, Prachi, Vahdat, Amin, and Doyle, Ronald (2001). Managing Energy and Server Resources in Hosting Centres. In ACM Symposium on Operating Systems Principles (SOSP), pages 103–116, Banff, Canada.Google Scholar
  13. Cidon, Israel, Kutten, Shay, and Soffer, Ran (2001). Optimal Allocation of Electronic Content. In IEEE Infocom, pages 1773–1780, Anchorage, AK.Google Scholar
  14. Cook, Stephen, Pachl, Jan, and Pressman, Irwin (2002). The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy. Distributed Computing, 15(1):57–66.CrossRefGoogle Scholar
  15. Delgadillo, Kevin (1999). Cisco DistributedDirector. Cisco Systems Inc.Google Scholar
  16. Dowdy, Lawrence and Foster, Derrell (1982). Comparative Models of the File Assignment Problem. ACM Computer Surveys, 14(2):287–313.CrossRefGoogle Scholar
  17. Drezner, Zvi and Hamacher, Horst, editors (2001). Facility Location Theory: Applications and Methods. Springer-Verlag, Berlin. ISBN 3-540-21345-7.Google Scholar
  18. Garey, Michael and Johnson, David (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Company. ISBN 0-7167-1045-5.Google Scholar
  19. Hakimi, S. Louis (1964). Optimum Location of Switching Centers and the Absolute Centers and Medians of a Graph. Operations Research, 12:450–459.zbMATHCrossRefGoogle Scholar
  20. Huang, Chengdu and Abdelzaher, Tarek (2004). Towards Content Distribution Networks with Latency Guarantees. In International Workshop on Quality of Service (IWQoS), pages 181–192, Montreal, Canada.Google Scholar
  21. Huffaker, Bradley, Fomenkov, Marina, Plummer, Daniel, Moore, David, and K. Claffy (2002). Distance Metrics in the Internet. In International Telecommunications Symposium (ITS), Natal, Brazil.Google Scholar
  22. Jamin, Sugih, Jin, Cheng, Jin, Yixin, Raz, Danny, Shavitt, Yuval, and Zhang, Lixia (2000). On the Placement of Internet Instrumentation. In IEEEInfocom, pages 295–304, Tel-Aviv, Israel.Google Scholar
  23. Jamin, Sugih, Jiu, Cheng, Kurc, Anthony, Raz, Danny, and Shavitt, Yuval (2001). Constrained Mirror Placement on the Internet. In IEEE Infocom, pages 31–40, Anchorage, AK.Google Scholar
  24. Jiang, Yingyin, Wu, Min-You, and Shu, Wei (2002). Web Prefetching: Costs, Benefits and Performance. In International Workshop on Web Content Caching and Distribution (WCW), pages 199–212, Boulder, CO.Google Scholar
  25. Kalpakis, Konstantinos, Dasgupta, Koustuv, and Wolfson, Ouri (2001). Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs. IEEE Transactions on Parallel and Distributed Systems, 12(6):628–637.CrossRefGoogle Scholar
  26. Kangasharju, Jussi, Roberts, James, and Ross, Keith (2002). Object Replication Strategies in Content Distribution Networks. Computer Communications, 25(4):367–383.CrossRefGoogle Scholar
  27. Karger, David, Sherman, Alex, Berkheimer, Andy, Bogstad, Bill, Dhanidina, Rizwan, Iwamoto, Ken, Kim, Brian, Matkins, Luke, and Yerushalmi, Yoav (1999). Web Caching with Consistent Hashing. In International World Wide Web Conference (WWW), pages 1203–1213. Toronto, Canada.Google Scholar
  28. Karlsson, Magnus and Karamanolis, Christos (2004). Choosing Replica Placement Heuristics for Wide-Area Systems. In International Conference on Distributed Computing Systems (ICDCS), pages 350–359, Hachioji, Japan.Google Scholar
  29. Karlsson, Magnus, Karamanolis, Christos, and Mahalingam, Mallik (2002). A Framework for Evaluating Replica Placement Algorithms. Technical Report HPL-2002-219, HP Laboratories. http://www.hpl.hp.com/personal/Magnus_Karlsson.Google Scholar
  30. Karlsson, Magnus and Mahalingam, Mallik (2002). Do We Need Replica Placement Algorithms in Content Delivery Networks? In International Workshop on Web Content Caching and Distribution (WCW), pages 117–128, Boulder, CO.Google Scholar
  31. Korupolu, Madhukar, Plaxton, Greg, and Rajaraman, Rajmohan (2000). Analysis of a Local Search Heuristic for Facility Location Problems. Journal of Algorithms, 37(1):146–188.MathSciNetCrossRefzbMATHGoogle Scholar
  32. Korupolu, Madhukar, Plaxton, Greg, and Rajaraman, Rajmohan (2001). Placement Algorithms for Hierarchical Cooperative Caching. Journal of Algorithms, 38(1):260–302.MathSciNetCrossRefzbMATHGoogle Scholar
  33. Krick, C., Räcke, H., and Westermann, M. (2001). Approximation Algorithms for Data Management in Networks. In ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 237–246, Heraklion, Greece.Google Scholar
  34. Kurose, James and Simha, Rahul (1989). A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems. IEEE Transactions on Computers, 38(5):705–717.CrossRefGoogle Scholar
  35. Lu, Chenyang, Wang, Xiaorui, and Koutsoukos, Xenofon (2004). End-to-end utilization control in distributed real-time systems. In International Conference on Distributed Computing Systems (ICDCS), Tokyo, Japan.Google Scholar
  36. Lu, Ying, Abdelzaher, Tarek, Lu, Chenyang, and Tao, Gang (2002). An adaptive control framework for QoS guarantees and its application to differentiated caching services. In International Workshop on Quality of Service (IWQoS), pages 23–32, Miami Beach, FL.Google Scholar
  37. Lund, Carsten, Reingold, Nick, Westbrook, Jeffrey, and Yan, Dicky (1999). Competitive On-Line Algorithms for Distributed Data Management. SIAM Journal of Computing, 28(3):1086–1111.MathSciNetCrossRefzbMATHGoogle Scholar
  38. Ng, Eugene and Zhang, Hui (2002). Predicting Internet Network Distance with Coordinates-Based Approaches. In IEEE Infocom, New York, NY.Google Scholar
  39. On, Giwon, Schmitt, Jens, and Steinmetz, Ralf (2003). Quality of Availability: Replica Placement for Widely Distributed Systems. In International Workshop on Quality of Service (IWQoS), pages 325–342, Monterey, CA.Google Scholar
  40. O’Neil, Elizabeth, O’Neil, Patrick, and Weikum, Gerhard (1993). The LRU-K Page Replacement Algorithm For Database Disk Buffering. In ACM SIGMOD International Conference on Management of Data (SIGMOD), pages 297–306, Washington, D.C.Google Scholar
  41. Plaxton, Greg, Rajaraman, Rajmohan, and Richa, Andréa (1999). Accessing Nearby Copies of Replicated Objects in a Distributed Environment. Theory of Computing Systems, 32(3):241–280.MathSciNetCrossRefzbMATHGoogle Scholar
  42. Qiu, Lili, Padmanabhan, Venkata, and Voelker, Geoffrey (2001). On the Placement of Web Server Replicas. In IEEE Infocom, pages 1587–1596, Anchorage, AK.Google Scholar
  43. Rabinovich, Michael and Aggarwal, Amit (1999). RaDaR: A Scalable Architecture for a Global Web Hosting Service. In International World Wide Web Conference (WWW), pages 1545–1561, Toronto, Canada.Google Scholar
  44. Rabinovich, Michael, Rabinovich, Irina, Rajaraman, Rajmohan, and Aggarwal, Amit (1999). A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service. In International Conference on Distributed Computing Systems (ICDCS), pages 101–113, Austin, TX.Google Scholar
  45. Radoslavov, Pavlin, Govindan, Ramesh, and Estrin, Deborah (2002). Topology-Informed Internet Replica Placement. Computer Communications Review, 25(4):384–392.CrossRefGoogle Scholar
  46. Radware (2002). Web Server Director. Radware Inc.Google Scholar
  47. Rowstron, Anthony and Druschel, Peter (2001). Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In ACM/IFIP/USENIX International Middleware Conference (MIDDLEWARE), pages 329–350, Heidelberg, Germany.Google Scholar
  48. Savage, Stefan, Collins, Andy, Hoffman, Eric, Snell, John, and Anderson, Thomas E. (1999). The End-to-End Effects of Internet Path Selection. In ACM Conference of the Special Interest Group on Data Communication (SIGCOMM), pages 289–299,Cambridge, MA.Google Scholar
  49. Sivasubramanian, Swaminathan, Szymaniak, Michal, Pierre, Guillaume, and van Steen, Maarten (2005). Replication for Web Hosting Systems. ACM Computer Surveys.Google Scholar
  50. Stoica, Ion, Morris, Robert, Karger, David, Kaashoek, Frans, and Balakrishnan, Hari (2001). Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In ACM Conference of the Special Interest Group on Data Communication (SIGCOMM), pages 149–160. San Diego, CA.Google Scholar
  51. Tang, Xueyan and Xu, Jianliang (2004). On Replica Placement for QoS-Aware Content Distribution. In IEEE Infocom. Hong Kong, China.Google Scholar
  52. Vazirani, Vijay (2001). Approximation Algorithms. ISBN 3-540-65367-8. SpringerVerlag.Google Scholar
  53. Wolfson, Ouri and Jajodia, Sushil (1992). Distributed algorithms for dynamic replication of data. In ACM Symposium on Principles of Database Systems (PODS), pages 149–163, San Diego, CA.Google Scholar
  54. Wolfson, Ouri, Jajodia, Sushil, and Huang, Yixui (1997). An Adaptive Data Replication Algorithm. ACM Transactions on Database Systems, 22(2):255–314.CrossRefGoogle Scholar
  55. Wolfson, Ouri and Milo, Amir (1991). The Multicast Policy and Its Relationship of Replicated Data Placement. ACM Transactions on Database Systems, 16(1):181–205.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • Magnus Karlsson
    • 1
  1. 1.HP LabsPalo AltoUSA

Personalised recommendations