A scalable HTTP server: the NCSA prototype
Selected papers of the first conference on World-Wide Web
Toward a scalable distributed WWW server on workstation clusters
Journal of Parallel and Distributed Computing
Internet Web servers: workload characterization and performance implications
IEEE/ACM Transactions on Networking (TON)
Analysis of Task Assignment Policies in Scalable Distributed Web-Server Systems
IEEE Transactions on Parallel and Distributed Systems
Network dispatcher: a connection router for scalable Internet services
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Critical path analysis of TCP transactions
IEEE/ACM Transactions on Networking (TON)
Dynamic Load Balancing on Web-Server Systems
IEEE Internet Computing
Lessons Learned Administering Netscape's Internet Site
IEEE Internet Computing
INFORMS Journal on Computing
Understanding Internet traffic streams: dragonflies and tortoises
IEEE Communications Magazine
Hi-index | 0.00 |
Distributed Web-server systems have been widely used to provide effective Internet services. The management of these systems requires dynamic controls of the Web traffic. With the development of multimedia Web sites and increasingly diversified services, the existing load balancing approaches can no longer satisfy the requirements of either the service providers or the users. In this paper, a new reward-based control mechanism is proposed that can satisfy the dynamic content-based control requirement while avoiding congestion at the dispatcher. The core of the control algorithm is based on an MDP model. To minimize the system overhead, a centralized dispatching with decentralized admission (CDDA) approach is used to distribute the control related computation to each server pool. This cuts down the dimensions of the problem dramatically, We also propose a state-block scheme to further reduce the state space so that the algorithm becomes computationally feasible for on-line implementation. Simulation results demonstrate that the proposed state-block approach can not only reduce the computation time dramatically but also provide a good approximation of power-tailed request interarrival times common for Internet traffic, Finally, an implementation plan with system design is also proposed.