ONE-IP: techniques for hosting a service on a cluster of machines
Selected papers from the sixth international conference on World Wide Web
Scalable internet servers: issues and challenges
ACM SIGMETRICS Performance Evaluation Review
Dynamic Load Balancing on Web-Server Systems
IEEE Internet Computing
High-Performance Web Site Design Techniques
IEEE Internet Computing
Tradeoffs in Designing Web Clusters
IEEE Internet Computing
Improved Strategies for Dynamic Load Balancing
IEEE Concurrency
Socket-based RR scheduling scheme for tightly coupled clusters providing single-name images
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
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.