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. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Banerjee, P., D’Costa, S., & Bhattacharya, S. (2010). Modified Go-Left Balls and Bins Algorithm for Server Load Balancing. In Communications in Computer and Information Science (Vol. 101, pp. 237–242). https://doi.org/10.1007/978-3-642-15766-0_34
Mendeley helps you to discover research relevant for your work.