An Improved dynamic Load Balancing Algorithm applied to a Cafeteria System in a University Campus

Daraghmi, E and Eleyan, A (2017) An Improved dynamic Load Balancing Algorithm applied to a Cafeteria System in a University Campus. In: International Conference on Future Networks and Distributed Systems (ICFNDS) 2017, 19 July 2017 - 20 July 2017, Cambridge, UK.

Preview

Available under License In Copyright. Download (1MB) | Preview

Abstract

Load-balancing algorithms play a key role in improving the performance of practical distributed systems that consist of heterogeneous nodes. The performance of any load-balancing algorithms and its convergence-rate is affected by the structural factors of the network that executes the algorithm. The performance deteriorated as the number of system nodes, the network-diameter, the communication-overhead increased. Moreover, additional technical-factors of the algorithm itself significantly affect the performance of rebalancing the load among nodes. Therefore, this paper proposes an approach that improves the performance of load-balancing algorithms by considering the load-balancing technical-factors and the structure of the network executes the algorithm. We applied the proposed method to a cafeteria system in a university campus and compared our approach with two significant methods presented in the literature. Results indicate that our approach considerably outperformed the original neighborhood approach and the nearest neighbor approach in terms of response time, throughput, communication overhead, and movements cost.