Computing, Artificial Intelligence and Information Technology Performance analysis and optimization of web proxy servers and mirror sites

Abstract In this paper, web proxy servers and mirror sites that cache either partial or complete information of their parent web servers are considered. These proxy servers are usually located strategically, for example near high-user-demand locations. Using proxy servers would significantly reduce latency for the users in retrieving information as well as alleviate congestion in the network. The main problem addressed in this paper is determining the optimal number and locations of proxy servers in a network to minimize costs subject to delay, throughput and demand constraints. For a given set of proxy server locations, it is assumed that client or user requests at a location will always be sent to the nearest server. Thereby each client–server system can be modeled as an independent queueing network for which performance measures such as delay distribution and throughput are obtained. These performance measures are used in an optimization problem that is formulated to determine the optimal number and optimal location of proxy servers. A heuristic called the DEJAVU algorithm is developed to solve the optimization problem. Based on a comparison with a genetic algorithm, it can be concluded that the DEJAVU algorithm produces near-optimal to optimal results in a very short time.

[1]  Oded Berman,et al.  Optimal Server Location on a Network Operating as an M/G/1 Queue , 1985, Oper. Res..

[2]  V. Kulkarni.  Modeling and Analysis of Stochastic Systems , 1996 .

[3]  Jean C. Walrand,et al.  High-performance communication networks , 1999 .

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

[5]  Jeffrey C. Mogul,et al.  The case for persistent-connection HTTP , 1995, SIGCOMM '95.

[6]  W. Whitt,et al.  Performance of the Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[7]  George L. Nemhauser,et al.  Min-cut clustering , 1993, Math. Program..

[8]  Sally Floyd,et al.  Why we don't know how to simulate the Internet , 1997, WSC '97.

[9]  Oded Berman,et al.  Optimal Location of Discretionary Service Facilities , 1992, Transp. Sci..

[10]  Panganamala Ramana Kumar,et al.  A Tutorial on Some New Methods for Performance Evaluation of Queueing Networks , 1995, IEEE J. Sel. Areas Commun..

[11]  Bruce A. Mah,et al.  An empirical model of HTTP network traffic , 1997, Proceedings of INFOCOM '97.

[12]  J. George Shanthikumar,et al.  Optimal server allocation in a system of multi-server stations , 1987 .

[13]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

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

[15]  Steven Glassman,et al.  A Caching Relay for the World Wide Web , 1994, Comput. Networks ISDN Syst..

[16]  Peter Scheuermann,et al.  Selection algorithms for replicated Web servers , 1998, PERV.

[17]  Carl M. Harris,et al.  Fundamentals of queueing theory , 1975 .

[18]  Jeffrey C. Mogul,et al.  Improving HTTP Latency , 1995, Comput. Networks ISDN Syst..

[19]  J. Ben Atkinson,et al.  Modeling and Analysis of Stochastic Systems , 1996 .

[20]  Jean C. Walrand,et al.  An introduction to queueing networks , 1989, Prentice Hall International editions.

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

[22]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .