Openly accessible

Load balance algorithms for anycast

Yu, Shui, Zhou, Wanlei and Casey, J. 2004, Load balance algorithms for anycast, in iiWAS2004 : Sixth International Conference on Information Integration and Web-based Applications Services, 27-29 September 2004, Jakarta, Indonesia, Austrian Computer Society, Vienna, Austria, pp. 471-480.

Attached Files
Name Description MIMEType Size Downloads
zhou-loadbalancealgorithms-2004.pdf Published version application/pdf 67.65KB 238

Title Load balance algorithms for anycast
Author(s) Yu, Shui
Zhou, Wanlei
Casey, J.
Conference name Information Integration and Web-based Applications Services (6th : 2004, Jakarta)
Conference location Jakarta, Indonesia
Conference dates September 27-29 2004
Title of proceedings iiWAS2004 : Sixth International Conference on Information Integration and Web-based Applications Services, 27-29 September 2004, Jakarta, Indonesia
Editor(s) Kotsis, G.
Bressan, S.
Taniar, D.
Ibrahim, I. K.
Publication date 2004
Start page 471
End page 480
Publisher Austrian Computer Society
Place of publication Vienna, Austria
Summary Increasingly, replicated anycast servers are being used to deliver network applications and service ever increasing user requests. Therefore, the strategies used to guarantee network bandwidth prerequisites and perform load balancing across the nodes of an anycast group are critical to the performance of online applications. In this paper, we model user requests, network congestion and latency, and server load using a combination of hydro-dynamics and queuing theory to develop an efficient job distribution strategy. Current, anycast research does not explicitly consider the system load of nodes within an anycast groups when distributing requests. Therefore, the performance of a heavily loaded anycast system can quickly become congested and uneven as jobs are routed to closely linked nodes which are already saturated with requests. In comparison, the nodes of further away systems remain relatively unused because of other issues such as network bandwidth and latency during these times. Our system redirects requests from busy systems to the idle, remotely linked nodes, to process requests faster in spite of slower network access. Using an empirical study, we show this technique can improve request performance, and throughput with minimal network probing overhead.
Notes Reproduced with the specific permission of the copyright owner.
ISBN 3902134720
9783902134721
Language eng
Field of Research 099999 Engineering not elsewhere classified
Socio Economic Objective 890299 Computer Software and Services not elsewhere classified
HERDC Research category E1 Full written paper - refereed
Copyright notice ©2004, Austrian Computer Society
Persistent URL http://hdl.handle.net/10536/DRO/DU:30005545

Document type: Conference Paper
Collections: School of Engineering and Information Technology
Open Access Collection
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Access Statistics: 408 Abstract Views, 238 File Downloads  -  Detailed Statistics
Created: Mon, 07 Jul 2008, 09:51:03 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.