A Framework for Evaluating Replica Placement Algorithms

This paper introduces a framework for evaluating replica placement algorithms (RPA) for content delivery networks (CDN) as well as RPAs from other fields that might be applicable to current or future CDNs. First, the framework classifies and qualitatively compares RPAs using a generic set of primitives that capture problem definitions and heuristics. Second, it provides estimates for the decision times of RPAs using an analytic model. To achieve accuracy, the model takes into account disk accesses and message sizes, in addition to computational complexity and message numbers that have been considered traditionally. Third, it uses the “goodness” of produced placements to compare RPAs even when they have different problem definitions. Based on these evaluations, we identify open issues and potential areas for future research.

[1]  Friedhelm Meyer auf der Heide,et al.  Provably Good and Practical Strategies for Non-Uniform Data Management in Networks , 1999, ESA.

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

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

[4]  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).

[5]  Arun Venkataramani,et al.  Bandwidth constrained placement in a WAN , 2001, PODC '01.

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

[7]  Morton E. O'Kelly,et al.  The Location of Interacting Hub Facilities , 1986, Transp. Sci..

[8]  Martin Arlitt,et al.  A workload characterization study of the 1998 World Cup Web site , 2000, IEEE Netw..

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

[10]  Nabil R. Adam,et al.  Distributed file allocation with consistency constraints , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[11]  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).

[12]  K. Dan Levin,et al.  Optimizing distributed data bases: a framework for research , 1975, AFIPS '75.

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

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

[15]  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).

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

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

[18]  Balachander Krishnamurthy,et al.  On network-aware clustering of Web clients , 2000, SIGCOMM.

[19]  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).

[20]  Philip S. Yu,et al.  Replication Algorithms in a Remote Caching Architecture , 1993, IEEE Trans. Parallel Distributed Syst..

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

[22]  Mark S. Daskin,et al.  3 Discrete Network Location Models , 2001 .

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

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

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

[26]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[27]  Katia Obraczka,et al.  Network latency metrics for server proximity , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[28]  Dorit S. Hochbaum,et al.  Database Location in Computer Networks , 1980, JACM.

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

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

[31]  J. Spruce Riordon,et al.  Optimal allocation of resources in distributed information networks , 1976, TODS.

[32]  Bruce M. Maggs,et al.  Exploiting locality for data management in systems of limited bandwidth , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

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

[34]  Martin Arlitt,et al.  Workload Characterization of the 1998 World Cup Web Site , 1999 .

[35]  P. Krishnan,et al.  The cache location problem , 2000, TNET.

[36]  Matthias Westermann,et al.  Caching in Networks , 1999, GI Jahrestagung.

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

[38]  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).

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

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

[41]  K. Mani Chandy,et al.  File allocation in distributed systems , 1976, SIGMETRICS '76.

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

[43]  Balachander Krishnamurthy,et al.  On network-aware clustering of Web clients , 2000, SIGCOMM 2000.

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

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

[46]  Friedhelm Meyer auf der Heide,et al.  Data Management in Networks: Experimental Evaluation of a Provably Good Strategy , 1999, SPAA '99.

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

[48]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.