Abstract
This paper introduces a novel algorithm for content based switching. A content based scheduling algorithm (QoS Aware Load Balancing Algorithm, QoS-LB) which can be used at the front-end of the server cluster is presented. The front-end switch uses the content information of the requests and the load on the back servers to choose the server to handle each request. At the same time, different Quality of Service (QoS) classes of the customers can be considered as one parameter in the load balancing algorithm. This novel feature becomes more important when service providers begin to offer the same services for customers with different priorities.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Andresen et al. SWEB: Towards a Scalable WWW Server on MultiComputers. In Proceedings of the 10th International Parallel Processing Symposium, Apr. 1996
E. Amir, S. McCanne, R. H. Katz: An Active Service Framework and Its Application to Real Time Multimedia Transcoding. Proceedings ACM SIGCOMM, 1998.
G. Apostopoulos, D. Aubespin, V. Peris, P. Pradhan, D. Saha: Design, Implementation and Performance of a Content-Based Switch. Proceedings of IEEE INFOCOM 2000.
T. Brisco. DNS Support for Load Balancing. RFC 1794, Apr. 1995.
Cisco Systems Inc. LocalDirector. http://www.cisco.com.
O. P. Damani, P. Y. E. Chung, Y. Huang, C. Kintala, and Y. M. Wang: ONE-IP: Techniques for hosting a service on a cluster of machines. Computer Networks and ISDN System
A. Fox, S. D. Gribble, Y. Chawathe, E. A. Brewer, and P. Gauthier: Cluster-based scalable network services. In Proceedings of the Sixteenth ACM Symposium on Operating System Principles, San Malo, France, Oct. 1997. s, 29:1019–1027, 1997.
G. Hunt, E. Nahum, and J. Tracey: Enabling content-based load distribution for scalable services. Technical report, IBM T.J. Watson Research Center, May 1997.
IBM Corporation. IBM interactive network dispatcher. http://www.ics.raleigh.ibm.com/ics/isslearn.htm.
W. Leland, M. Taqqu, W. Willinger and D. Wilson: On the self-similar nature of Ethernet traffic (extended version). IEEE/ACM Tran. Networking, Vol. 2, 1994, pp. 1–15.
J. Liedtke, V. Panteleenko, T. Jaeger, and N. Islam: High-performance caching with the Lava hit-server. In Proceedings of the USENIX 1998 Annual Technical Conference, New Orleans, LA, June 1998.
V. S. Pai, M Aron, G. Banga, M. Svendsen, P. Druschel, W. Zwaenepoel, E. Nahum: Locality-Aware Request Distribution in Cluster-Based Network Servers. In Architectural Support for Programming Languages and Operating Systems, 1998.
V. Paxson and S. Floyd: Wide Area Traffic: The Failure of Poisson Modeling. IEEE/ACM Transactions on Networking, Vol. 3, No. 3, June 1995, pp. 226–244.
P. Pradhan, T. Chiueh, A. Neogi: Aggregate TCP Congestion Control Using Multiple Network Probing. Proceedings of ICDCS 2000.
Resonate Inc. Resonate dispatch. http://www.resonateinc.com.
B. Suter, T.V. Lakshman, D. Stiliadis, A.K Choudhury: Buffer Management Schemes for Supporting TCP in Gigabit Routers with Per-Flow Queueing. IEEE Journal in Selected Areas in Communications, August 1999.
B. Tsybakov, N. D. Georganas: On Self-Similar Traffic in ATM Queues: Definitions, Overflow Probability Bound, and Cell Delay Distribution. IEEE/ACM Transactions on Networking, Vol. 5, No. 3, June 1997, pp. 397–409.
B. Yoshikawa et al.: Using Smart Clients to Build Scalable Services. In Proceedings of the 1997 Usenix Technical Conference, Jan. 1997.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaario, K., Hämäläinen, T., Zhang, J. (2001). Tuning of QoS Aware Load Balancing Algorithm (QoS–LB) for Highly Loaded Server Clusters. In: Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47734-9_25
Download citation
DOI: https://doi.org/10.1007/3-540-47734-9_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42303-4
Online ISBN: 978-3-540-47734-1
eBook Packages: Springer Book Archive