Robust CDN replica placement techniques

Creating replicas of frequently accessed data objects across a read-intensive Content Delivery Network (CDN) can result in reduced user response time. Because CDNs often operate under volatile conditions, it is of the utmost importance to study replica placement techniques that can cope with uncertainties in the system parameters. We propose four CDN replica placement heuristics that guarantee a robust performance under the uncertainty of arbitrary CDN server failures. By robust performance we mean the solution quality that a heuristic guarantees given the uncertainties in system parameters. The simulation results reveal interesting characteristics of the studied heuristics. We report these characteristics with a detailed discussion on which heuristics to utilize for robust CDN data replication given a specific scenario.

[1]  Anthony A. Maciejewski,et al.  Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness , 2007, The Journal of Supercomputing.

[2]  Hector Garcia-Molina,et al.  Mutual exclusion in partitioned distributed systems , 2005, Distributed Computing.

[3]  Ishfaq Ahmad,et al.  Discriminatory Algorithmic Mechanism Design Based WWW Content Replication , 2007, Informatica.

[4]  Ming Zhong,et al.  Replication degree customization for high availability , 2008, Eurosys '08.

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

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

[7]  Jean-Chrysostome Bolot,et al.  Performance Engineering of the World Wide Web: Application to Dimensioning and Cache Design , 1996, Comput. Networks.

[8]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[9]  Anthony A. Maciejewski,et al.  Stochastic robustness metric and its use for static resource allocations , 2008, J. Parallel Distributed Comput..

[10]  Paul Barford,et al.  Generating representative Web workloads for network and server performance evaluation , 1998, SIGMETRICS '98/PERFORMANCE '98.

[11]  Steffen Rothkugel,et al.  Enhancing the Web's Infrastructure: From Caching to Replication , 1997, IEEE Internet Comput..

[12]  Deying Li,et al.  On optimal replication of data object at hierarchical and transparent Web proxies , 2005, IEEE Transactions on Parallel and Distributed Systems.

[13]  Spiridon Bakiras,et al.  Combining replica placement and caching techniques in content distribution networks , 2005, Comput. Commun..

[14]  Jianliang Xu,et al.  QoS-aware replica placement for content distribution , 2005, IEEE Transactions on Parallel and Distributed Systems.

[15]  Anthony A. Maciejewski,et al.  Robust Resource Allocation in Heterogeneous Parallel and Distributed Computing Systems , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[16]  Ishfaq Ahmad,et al.  Comparison and analysis of ten static heuristics-based Internet data replication techniques , 2008, J. Parallel Distributed Comput..

[17]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 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).

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

[19]  Bruce M. Maggs,et al.  Globally Distributed Content Delivery , 2002, IEEE Internet Comput..

[20]  Stefano Ceri,et al.  Distributed Databases: Principles and Systems , 1984 .

[21]  Anthony A. Maciejewski,et al.  Robust static allocation of resources for independent tasks under makespan and dollar cost constraints , 2007, J. Parallel Distributed Comput..

[22]  George Pallis,et al.  Content Delivery Networks: Status and Trends , 2003, IEEE Internet Comput..