Load sharing in the data centre is an essential strategy for meeting service levels in high volume and high availability services. We investigate the accuracy with which simple, classical queueing models can predict the scaling behaviour of server capacity in an environment of both homogeneous and inhomogeneous hardware, using known traffic patterns as input. We measure the performance of three commonly used load sharing algorithms and show that the simple queueing models underestimate performance needs significantly at high load. Load sharing based on real-time network monitoring performs worst on average. The work has implications for the accuracy of Quality of Service estimates. © IFIP International Federation for Information Processing 2006.
CITATION STYLE
Burgess, M., & Undheim, G. (2006). Predictable scaling behaviour in the data centre with multiple application servers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4269 LNCS, pp. 49–60). Springer Verlag. https://doi.org/10.1007/11907466_5
Mendeley helps you to discover research relevant for your work.