A dynamic dispatcher-based scheduling algorithm on load balancing for web server cluster

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Bao, L., Zhao, D., & Zhao, Y. (2010). A dynamic dispatcher-based scheduling algorithm on load balancing for web server cluster. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6318 LNCS, pp. 95–102). https://doi.org/10.1007/978-3-642-16515-3_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free