Our paper proposes an algorithm for a web switch that manages a cluster of web servers, evaluated through discrete event simulation as the first step in the construction of a new web switch. The web switch model is based on the estimation of the throughput that the servers would have in the next future to dynamically balance the workload according to a pre-established quality of service for different types of users. In order to reduce the checking time, estimations are only computed in a variable slot scheduling. Simulation results show that a commitment between overhead and performance should be established to obtain good results in a stressed web cluster of servers. © Springer-Verlag 2004.
CITATION STYLE
Gilly, K., Juiz, C., Puigjaner, R., & Alcaraz, S. (2004). Performance analysis of a predictive and adaptive algorithm in cluster-based network servers with resource allocation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3280, 615–626. https://doi.org/10.1007/978-3-540-30182-0_62
Mendeley helps you to discover research relevant for your work.