Abstract
Server selection is an important problem in replicated server systems distributed over the Internet. In this paper, we study two server selection algorithms under a server-based framework we have developed. These algorithms utilize server load and network performance information collected through a shared passive measurement mechanism to determine the appropriate server for processing a client request. The performance of these algorithms is studied using simulations. Comparison with two naive server selection algorithms is also made. The initial simulation results show that our dynamic server selection algorithms have superior performance over the two naive ones, and as a result, demonstrate the importance of dynamic server selection mechanisms in a replicated server system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Balakrishnan, V. N. Padmanabhan, S. Seshan, M. Stemm, and R. H. Katz, “Analyzing stability in wide-area network performance,” in Proc. ACM SIGMETRICS’97, June 1997.
H. Balakrishnan, V. N. Padmanabhan, S. Seshan, M. Stemm, and R. H. Katz, “TCP behavior of a busy Internet server: analysis and improvements,” in Proc. IEEE INFOCOM’98, San Francisco, CA, March 1998.
P. Barford and M. E. Crovella, “Generating representative web workloads for network and server performance evaluation,” Technical Report BU-CS-97-006, Dec. 1997.
J. Bolot, “Characterizing end-to-end packet delay and loss in the I Internet,” Journal of High Speed Networks, vol. 2, no. 3, pp. 305–323, Dec. 1993.
C. M. Bowman, et. al., “Harvest: a scalable, customizable, discovery and access system,” Technical Report CU-CS-732-94, Dept. of Computer Science, University of Colorado at Boulder, 1994.
N. Cardwell, S. Savage, and T. Anderson “Modeling the performance of short TCP connections,” Oct. 1998.
R. L. Carter and M. E. Crovella, “Measuring bottleneck link speed in packet-switched networks,” Performance Evaluation, vol. 27 & 28, 1996.
R. L. Carter and M. E. Crovella, “Dynamic server selection using bandwidth probing in wide-area networks,” in Proc. IEEE INFOCOM’97, Kobe, Japan.
C. R. Cunha, A. Bestavros, and M. E. Crovella, “Characteristics of WWW client-based traces,” in Proc. ACM SIGMETRICS’96.
Y. Dong, Y. T. Hou, and Z.-L. Zhang, “A novel server-based measurement infrastructure for Enterprise Networks ”, Technique Report TR 98-031, Dept. of Computer Science, University of Minnesota, 1998.
Z. Fei, S. Bhattacharjee, E. W. Zegura, and M. Ammar, “A novel server selection technique for improving the response time of a replicated service,” in Proc. IEEE INFOCOM’98, San Francisco, CA, 1998.
J. Guyton and M. Schwartz, “Locating nearby copies of replicated Internet services,” in Proc. ACM SIGCOMM’95, Cambridge, MA, 1995.
J. Hennessy and D. Patterson, Computer Architecture: A Quantitative Approach, Second Edition, Morgan Kaufmann Publishers, Inc., 1996.
Y. T. Hou, Y. Dong, and Z.-L. Zhang, “Network performance measurement and analysis-part 1: a server-based measurement infrastructure”, Technical Memorandum FLA-NCRTM98-01, Fujitsu Laboratories of America, CA, July, 1998.
Internet Distance Maps Project, http://idmaps.eecs.umich.edu/.
V. Jacobson, pathchar-A Tool to Infer Characteristics of Internet Paths, http://ee.lbl.gov/nrg-talks.html, April 1997.
J. Mahdavi and Sally Floyd, “TCP-Friendly Unicast Rate-Based Flow Control”, The TCP-Friendly Website.
S. McCanne, C. Leres, and V. Jacobson, tcpdump, Lawrence Berkeley National Laboratory.
K. Moore, J. Cox, and S. Green, “SONAR-A Network Proximity Service,” Internet-Draft, http://www.netlib.org/utk/projects/sonar/, Aug. 1996.
A. Myers, P. Dinda, and H. Zhang, “Performance characteristics of mirror server on the Internet,” In Proc. IEEE INFOCOM’99, March 1999.
V. Paxson, “Measurements and analysis of end-to-end Internet dynamics,” Ph.D. Dissertation, U.C. Berkeley, 1997.
V. Paxson, J. Mahdavi, A. Adams, and M. Mathis, “An architecture for large-scale Internet measurement,” IEEE Commun. Magazine, pp. 48–54, Aug. 1998.
S. Seshan, M. Stemm, and R. Katz, “SPAND: shared passive network performance discovery,” in Proc. USENIX’97, 1997.
M. Yajnik, J. Kurose, and D. Towsley “Packet loss correlation in the MBone multicast network,” Technical Report UMASS CMPSCI 96-32, Dept. of Computer Science, Univ. of Mass. at Amherst, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dong, Y., Zhang, ZL., Hou, Y.T. (2002). Server-Based Dynamic Server Selection Algorithms. In: Chong, I. (eds) Information Networking: Wireless Communications Technologies and Network Applications. ICOIN 2002. Lecture Notes in Computer Science, vol 2344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45801-8_55
Download citation
DOI: https://doi.org/10.1007/3-540-45801-8_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44255-4
Online ISBN: 978-3-540-45801-2
eBook Packages: Springer Book Archive