Skip to main content
SpringerLink
Log in
Book cover

Web Content Delivery pp 23–43Cite as

Replica Placement and Request Routing

  • Chapter

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • 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 

  • Akamai (2005). Akamai. Cambridge, MA, USA. http://www.akamai.com.

    Google Scholar 

  • 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 

  • 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 

  • Androutsellis-Theotokis, Stephanos and Spinellis, Diomidis (2004). A survey of peer-to-peer content distribution technologies. ACM Computer Surveys, 36(4):335–371.

    Article  Google Scholar 

  • 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 

  • Awerbuch, Baruch, Bartal, Yair, and Fiat, Amos (1998). Distributed Paging for General Networks. Journal of Algorithms, 28(1):67–104.

    Article  MathSciNet  MATH  Google Scholar 

  • 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 

  • Balinski, Michel (1965). Integer Programming: Methods, Uses, Computation. Management Science, 12: 253–313.

    MATH  MathSciNet  Google Scholar 

  • 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 

  • 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 

  • 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 

  • Cidon, Israel, Kutten, Shay, and Soffer, Ran (2001). Optimal Allocation of Electronic Content. In IEEE Infocom, pages 1773–1780, Anchorage, AK.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • Delgadillo, Kevin (1999). Cisco DistributedDirector. Cisco Systems Inc.

    Google Scholar 

  • Dowdy, Lawrence and Foster, Derrell (1982). Comparative Models of the File Assignment Problem. ACM Computer Surveys, 14(2):287–313.

    Article  Google Scholar 

  • Drezner, Zvi and Hamacher, Horst, editors (2001). Facility Location Theory: Applications and Methods. Springer-Verlag, Berlin. ISBN 3-540-21345-7.

    Google Scholar 

  • 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 

  • Hakimi, S. Louis (1964). Optimum Location of Switching Centers and the Absolute Centers and Medians of a Graph. Operations Research, 12:450–459.

    Article  MATH  Google Scholar 

  • 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 

  • 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 

  • 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 

  • 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 

  • 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 

  • 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.

    Article  Google Scholar 

  • Kangasharju, Jussi, Roberts, James, and Ross, Keith (2002). Object Replication Strategies in Content Distribution Networks. Computer Communications, 25(4):367–383.

    Article  Google Scholar 

  • 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 

  • 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 

  • 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 

  • 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 

  • 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.

    Article  MathSciNet  MATH  Google Scholar 

  • Korupolu, Madhukar, Plaxton, Greg, and Rajaraman, Rajmohan (2001). Placement Algorithms for Hierarchical Cooperative Caching. Journal of Algorithms, 38(1):260–302.

    Article  MathSciNet  MATH  Google Scholar 

  • 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 

  • 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.

    Article  Google Scholar 

  • 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 

  • 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 

  • 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.

    Article  MathSciNet  MATH  Google Scholar 

  • Ng, Eugene and Zhang, Hui (2002). Predicting Internet Network Distance with Coordinates-Based Approaches. In IEEE Infocom, New York, NY.

    Google Scholar 

  • 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 

  • 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 

  • 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.

    Article  MathSciNet  MATH  Google Scholar 

  • 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 

  • 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 

  • 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 

  • Radoslavov, Pavlin, Govindan, Ramesh, and Estrin, Deborah (2002). Topology-Informed Internet Replica Placement. Computer Communications Review, 25(4):384–392.

    Article  Google Scholar 

  • Radware (2002). Web Server Director. Radware Inc.

    Google Scholar 

  • 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 

  • 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 

  • Sivasubramanian, Swaminathan, Szymaniak, Michal, Pierre, Guillaume, and van Steen, Maarten (2005). Replication for Web Hosting Systems. ACM Computer Surveys.

    Google Scholar 

  • 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 

  • Tang, Xueyan and Xu, Jianliang (2004). On Replica Placement for QoS-Aware Content Distribution. In IEEE Infocom. Hong Kong, China.

    Google Scholar 

  • Vazirani, Vijay (2001). Approximation Algorithms. ISBN 3-540-65367-8. SpringerVerlag.

    Google Scholar 

  • 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 

  • Wolfson, Ouri, Jajodia, Sushil, and Huang, Yixui (1997). An Adaptive Data Replication Algorithm. ACM Transactions on Database Systems, 22(2):255–314.

    Article  Google Scholar 

  • 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.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. HP Labs, 1501 Page Mill Rd, 1134, Palo Alto, CA, USA

    Magnus Karlsson

Authors
  1. Magnus Karlsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Nanyang Technological University, Singapore

    Xueyan Tang

  2. Hong Kong Baptist University, Hong Kong

    Jianliang Xu

  3. Hong Kong University of Science and Technology, Hong Kong

    Samuel T. Chanson

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Karlsson, M. (2005). Replica Placement and Request Routing. In: Tang, X., Xu, J., Chanson, S.T. (eds) Web Content Delivery. Web Information Systems Engineering and Internet Technologies Book Series, vol 2. Springer, Boston, MA. https://doi.org/10.1007/0-387-27727-7_2

Download citation

  • DOI: https://doi.org/10.1007/0-387-27727-7_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-24356-6

  • Online ISBN: 978-0-387-27727-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation