Skip to main content
SpringerLink
Log in

Modified Go-Left Balls and Bins Algorithm for Server Load Balancing

  • Conference paper
Book cover Information and Communication Technologies (ICT 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 101))

  • 1244 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Vocking, B.: How Asymmetry Helps Load Balancing. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science. IEEE, Los Alamitos (1999)

    Google Scholar 

  2. 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)

    Google Scholar 

  3. Harary, E.: Graph Theory. Addison-Wesley, Reading

    Google Scholar 

  4. Mitzenmacher, M.: The Power of Two Choices in Randomized Load Balancing. PhD thesis, University of California at Berkeley (1996)

    Google Scholar 

  5. Knuth, D.E.: The Art of Computer Programming, vol. 3. Addison Wesley, Reading (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, University of Calcutta, West Bengal, India

    Prasun Banerjee, Stephan D’Costa & Sukriti Bhattacharya

Authors
  1. Prasun Banerjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stephan D’Costa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sukriti Bhattacharya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Engineers Network, Trivandrum, Kerala, India

    Vinu V Das

  2. NSS College of Engineering, Palakkadu, India

    R. Vijaykumar

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation