Abstract
This paper proposes a modified version of Go-left Balls & Bins algorithm for server load balancing using K-Partite property of a graph. The previous algorithms all had to keep knowledge of the past load distribution information while distributing new load -an issue that is virtually impossible in real life as it itself congests the server with load. But ours algorithm is random in nature and hence sheds this overhead; this is also quite realistic in nature and close to the implementation domain.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Vocking, B.: How Asymmetry Helps Load Balancing. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science. IEEE, Los Alamitos (1999)
Long, B., Wu, X., Zhang, Z.M., Yu, P.S.: Unsupervised learning on k-partite graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, New York (2006)
Harary, E.: Graph Theory. Addison-Wesley, Reading
Mitzenmacher, M.: The Power of Two Choices in Randomized Load Balancing. PhD thesis, University of California at Berkeley (1996)
Knuth, D.E.: The Art of Computer Programming, vol. 3. Addison Wesley, Reading (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Banerjee, P., D’Costa, S., Bhattacharya, S. (2010). Modified Go-Left Balls and Bins Algorithm for Server Load Balancing. In: Das, V.V., Vijaykumar, R. (eds) Information and Communication Technologies. ICT 2010. Communications in Computer and Information Science, vol 101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15766-0_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-15766-0_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15765-3
Online ISBN: 978-3-642-15766-0
eBook Packages: Computer ScienceComputer Science (R0)