Replica Placement and Request Routing

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.

[1]  Stefan Savage,et al.  The end-to-end effects of Internet path selection , 1999, SIGCOMM '99.

[2]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

[3]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Konstantinos Kalpakis,et al.  Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs , 2001, IEEE Trans. Parallel Distributed Syst..

[5]  Magnus Karlsson,et al.  Choosing replica placement heuristics for wide-area systems , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[6]  Ralph Arnote,et al.  Hong Kong (China) , 1996, OECD/G20 Base Erosion and Profit Shifting Project.

[7]  B. Huffaker,et al.  Distance Metrics in the Internet , 2002, Anais do 2002 International Telecommunications Symposium.

[8]  Eric Anderson,et al.  Quickly finding near-optimal storage designs , 2005, TOCS.

[9]  Rajmohan Rajaraman,et al.  Approximation algorithms for data placement in arbitrary networks , 2001, SODA '01.

[10]  Arun Venkataramani,et al.  The potential costs and benefits of long-term prefetching for content distribution , 2002, Comput. Commun..

[11]  Aravind Srinivasan,et al.  Clustering and server selection using passive monitoring , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Michal Szymaniak,et al.  Replication for web hosting systems , 2004, CSUR.

[13]  Carsten Lund,et al.  Competitive On-Line Algorithms for Distributed Data Management , 1999, SIAM J. Comput..

[14]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[15]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[16]  Magnus Karlsson,et al.  A Framework for Evaluating Replica Placement Algorithms , 2002 .

[17]  Sushil Jajodia,et al.  Distributed algorithms for dynamic replication of data , 1992, PODS.

[18]  Ouri Wolfson,et al.  The multicast policy and its relationship to replicated data placement , 1991, TODS.

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  Jianliang Xu,et al.  On replica placement for QoS-aware content distribution , 2004, IEEE INFOCOM 2004.

[21]  Yuval Rabani,et al.  Competitive algorithms for distributed data management (extended abstract) , 1992, STOC '92.

[22]  Amos Fiat,et al.  Distributed paging for general networks , 1996, SODA '96.

[23]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.

[24]  Rajmohan Rajaraman,et al.  A dynamic object replication and migration protocol for an Internet hosting service , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[25]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1999, Theory of Computing Systems.

[26]  Edward A. Fox,et al.  Removal Policies in Network Caches for World-Wide Web Documents , 1996, SIGCOMM.

[27]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[28]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[29]  Sandy Irani,et al.  Cost-Aware WWW Proxy Caching Algorithms , 1997, USENIX Symposium on Internet Technologies and Systems.

[30]  Chenyang Lu,et al.  An adaptive control framework for QoS guarantees and its application to differentiated caching , 2002, IEEE 2002 Tenth IEEE International Workshop on Quality of Service (Cat. No.02EX564).

[31]  Amos Fiat,et al.  Competitive distributed file allocation , 1993, STOC '93.

[32]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[33]  Rajmohan Rajaraman,et al.  Placement Algorithms for Hierarchical Cooperative Caching , 2001, J. Algorithms.

[34]  Stephen A. Cook,et al.  The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy , 2002, Distributed Computing.

[35]  Shay Kutten,et al.  Optimal allocation of electronic content , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[36]  Pavlin Radoslavov,et al.  Topology-informed Internet replica placement , 2002, Comput. Commun..

[37]  David R. Karger,et al.  Web Caching with Consistent Hashing , 1999, Comput. Networks.

[38]  Gerhard Weikum,et al.  The LRU-K page replacement algorithm for database disk buffering , 1993, SIGMOD Conference.

[39]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[40]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[41]  Rahul Simha,et al.  A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems , 1989, IEEE Trans. Computers.

[42]  Chenyang Lu,et al.  End-to-end utilization control in distributed real-time systems , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[43]  Magnus Karlsson,et al.  Do We Need Replica Placement Algorithms in Content Delivery Networks , 2002 .

[44]  Ralf Steinmetz,et al.  Quality of availability: replica placement for widely distributed systems , 2003, IWQoS'03.

[45]  Amit Aggarwal,et al.  RaDaR: A Scalable Architecture for a Global Web Hosting Service , 1999, Comput. Networks.

[46]  Tarek F. Abdelzaher,et al.  Towards content distribution networks with latency guarantees , 2004, Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004..

[47]  Lixia Zhang,et al.  On the placement of Internet instrumentation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[48]  Jussi Kangasharju,et al.  Object replication strategies in content distribution networks , 2002, Comput. Commun..

[49]  Rajmohan Rajaraman,et al.  Analysis of a local search heuristic for facility location problems , 2000, SODA '98.

[50]  Amin Vahdat,et al.  Managing energy and server resources in hosting centers , 2001, SOSP.

[51]  Sushil Jajodia,et al.  An adaptive data replication algorithm , 1997, TODS.

[52]  Harald Räcke,et al.  Approximation algorithms for data management in networks , 2001, SPAA.