A Comparative Analysis of Server Selection in Content Replication Networks

Server selection plays an essential role in content replication networks, such as peer-to-peer (P2P) and content delivery networks (CDNs). In this paper, we perform an analytical investigation of the strengths and weaknesses of existing server selection policies, based initially on an M/G/1 processor sharing (PS) queueing-theoretic model. We develop a theoretical benchmark to evaluate the performance of two general server selection policies, referred to as EQ_DELAY and EQ_LOAD, which characterize a wide range of existing server selection algorithms. We find that EQ_LOAD achieves an average delay always higher than or equal to that of EQ_DELAY. A key theoretical result of this paper is that in an N-server system, the worst case ratio between the average delay of EQ_DELAY or EQ_LOAD and the minimal average delay (obtained from the benchmark) is precisely N. We constructively show how this worst case scenario can arise in highly heterogeneous systems. This result, when interpreted in the context of selfish routing, means that the price of anarchy in unbounded delay networks depends on the topology, and can potentially be very large. Our analytical findings are extended in asymptotic regimes to the G/G/1 first-come first-serve and multi-class M/G/1-PS models and supported by simulations run for various arrival and service processes, scheduling disciplines, and workload exhibiting temporal locality. These results indicate that our analysis is applicable to realistic scenarios.

[1]  Yin Zhang,et al.  On selfish routing in internet-like environments , 2006, TNET.

[2]  Ariel Orda,et al.  Architecting noncooperative networks , 1995, Eighteenth Convention of Electrical and Electronics Engineers in Israel.

[3]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[4]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

[5]  Chase Cotton,et al.  Packet-level traffic measurements from the Sprint IP backbone , 2003, IEEE Netw..

[6]  Tim Roughgarden,et al.  The price of anarchy is independent of the network topology , 2002, STOC '02.

[7]  J G Wardrop,et al.  CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[8]  B. Avi-Itzhak,et al.  On measuring fairness in queues , 2004, Advances in Applied Probability.

[9]  Srinivasan Seshan,et al.  A network measurement architecture for adaptive applications , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Samuel Karlin,et al.  A First Course on Stochastic Processes , 1968 .

[11]  Hui Zhang,et al.  Measurement-based optimization techniques for bandwidth-demanding peer-to-peer systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  Jia Wang,et al.  Analyzing peer-to-peer traffic across large networks , 2004, IEEE/ACM Trans. Netw..

[13]  Carey L. Williamson,et al.  Temporal locality and its impact on Web proxy cache performance , 2000, Perform. Evaluation.

[14]  Technical Note - Some Simpler Bounds on the Mean Queuing Time , 1978, Oper. Res..

[15]  Dan Rubenstein,et al.  Provisioning servers in the application tier for e-commerce systems , 2004, IWQoS.

[16]  Philip S. Yu,et al.  The state of the art in locally distributed Web-server systems , 2002, CSUR.

[17]  David D. Yao,et al.  Optimal load balancing and scheduling in a distributed computer system , 1991, JACM.

[18]  A. P. Zwart,et al.  Sojourn times in a multiclass processor sharing queue , 1998 .

[19]  Asser N. Tantawi,et al.  Optimal static load balancing in distributed computer systems , 1985, JACM.

[20]  Supranamaya Ranjan,et al.  DDoS-Resilient Scheduling to Counter Application Layer Attacks Under Imperfect Detection , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[21]  Supranamaya Ranjan,et al.  Wide area redirection of dynamic content by Internet data centers , 2004, IEEE INFOCOM 2004.

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

[23]  José R. Correa,et al.  On the Inefficiency of Equilibria in Congestion Games , 2005, IPCO.

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

[25]  Hisao Kameda,et al.  An algorithm for optimal static load balancing in distributed computer systems , 1992 .

[26]  Carey L. Williamson,et al.  ProWGen: a synthetic workload generation tool for simulation evaluation of web proxy caches , 2002, Comput. Networks.

[27]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

[28]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[29]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[30]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[31]  Christophe Diot,et al.  An approach to alleviate link overload as observed on an IP backbone , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[32]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[33]  亀田 壽夫,et al.  Optimal load balancing in distributed computer systems , 1997 .

[34]  Ellen W. Zegura,et al.  Application-layer anycasting: a server selection architecture and use in a replicated Web service , 2000, TNET.

[35]  Moshe Sidi,et al.  Modeling and analysis of power-tail distributions via classical teletraffic methods , 2000, Queueing Syst. Theory Appl..

[36]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[37]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[38]  David Starobinski,et al.  An analytical study of server selection for scalable internet services , 2007 .

[39]  Mario Gerla,et al.  On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..