Cart (Loading....) | Create Account
Close category search window
 

Predictive-adaptive algorithm for a cluster-based network web servers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)

The use of Web Clusters that implement Quality of Service has gained much attention in recent years. In this paper we propose an adaptive algorithm for a Web Switch that estimates the best configuration of the Web cluster attending to the throughput of servers. The slotted time used by the system is adaptive to the burstiness factor of client requests arriving to the Web Cluster. The web switch model is based on the estimation of the throughput that servers would have in the next future to dynamically balance the workload. In order to reduce the checking time, estimations are computed in a variable slot scheduling. Simulation results are confronted with other algorithms and show that the algorithm proposed performs significantly better in terms of latency time for priority users.

Published in:

Latin America Transactions, IEEE (Revista IEEE America Latina)  (Volume:4 ,  Issue: 1 )

Date of Publication:

March 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.