With ever increasing network traffic, distributed systems can provide higher performance using a typical dynamic load balancing (DLB) algorithm. Dynamic algorithm employs up to date load information of the nodes to make load distribution decisions and therefore, they have potential to outperform static strategies. In this paper, we illustrate the analytical comparative study of existing dynamic algorithms and result gives a thorough overview of various dynamic algorithms, helping designers in choosing the most appropriate approach for a variety of distributed systems. Moreover, researchers can use it as a catalog of available DLB schemes to come up with new design. © 2011 Springer-Verlag.
CITATION STYLE
Mehta, M. A., & Jinwala, D. C. (2011). Analytical parametric evaluation of dynamic load balancing algorithms in distributed systems. In Communications in Computer and Information Science (Vol. 147 CCIS, pp. 388–391). https://doi.org/10.1007/978-3-642-20573-6_68
Mendeley helps you to discover research relevant for your work.