Abstract
Effective Request distribution and load balance are the key technological means to guarantee higher-quality service in web server clusters system. Based on the ideas of dynamic load adaptation and priority service, this paper presents a new scheduling algorithm of load balance of web cluster servers. The theoretical model of this scheme is established with Markov chain and probability generating function. Mathematical analysis is made on the mean queue length and the mean inquiry cyclic time of the common queue and the key station. The findings of theoretical analysis and the experiments show that this algorithm optimizes the services of the system in time of load change input via adjustment of the times of the access gated, and strengthens the flexibility and fairness of multimedia transmissions in web cluster system.
This is a preview of subscription content, log in via an institution to check access.
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
Cardellini, V., Colajanni, M., Yu, P.S.: Dynamic load balancing on Web-server systems. IEEE Internet Computing 3, 28–39 (1999)
Hui, C.-C., Chanson, S.T.: Improved Strategies for Dynamic Load Balancing. IEEE Concurrency (1999)
Kant, K., Mohapatra, P.: Scalable Internet Servers: issues and challenges, performance and architecture of Web Servers (PAWS). In: ACM SIGMETRICS 2000 (2000)
Damani, O.P., Chung, P.E., Huang, Y., Kintala, C., Wang, Y.: ONE-IP: techniques for hosting a service on a cluster of machines. Journal of Computer Networks and ISDN Systems 29, 1019–1027 (1997)
Kant, K., Mohapatra, P.: Scalable Internet Servers: issues and challenges, performance and architecture of Web Servers (PAWS). In: ACM SIGMETRICS 2000 (2000)
Iyengar, A., Challenger, J., Dias, D., Dantzig, P.: High Performance Web server design technique. IEEE Internet Computing 4, 17–26 (2000)
Menasce, D.A.: Trade-offs in designing Web clusters. IEEE Internet Comput. 6, 76–80 (2002)
Baek, S., Rim, H., Kim, S.: Socket-based RR scheduling scheme for tightly coupled clusters providing single-name images. Journal of Systems Architecture 50(6), 299–308 (2004)
Dongfeng, Z., Sumin, Z.: Message Waiting Time Analysis for a Polling System with Gated Service. Journal of China Institute of Communications 15, 18–23 (1994)
Dongfeng, Z., Sumin, Z.: Analysis of a Polling Model with Exhaustive Service. Acta. Electronica Sinica 22, 102–107 (1994)
Wang, Z., Yu, H., Song, Y., Sun, Y.: Characteristics of Mean Period of M1+M2/G/1 Polling System under Mixed Service. Journal of China Institute of Communications 23, 8–18 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bao, L., Zhao, D., Zhao, Y. (2010). A Dynamic Dispatcher-Based Scheduling Algorithm on Load Balancing for Web Server Cluster. In: Wang, F.L., Gong, Z., Luo, X., Lei, J. (eds) Web Information Systems and Mining. WISM 2010. Lecture Notes in Computer Science, vol 6318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16515-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-16515-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16514-6
Online ISBN: 978-3-642-16515-3
eBook Packages: Computer ScienceComputer Science (R0)