Biased random walks on resource network graphs for load balancing

  • Authors:

  • M. Randles;O. Abu-Rahmeh;P. Johnson;A. Taleb-Bendiab

  • Affiliations:

  • School of Computing and Mathematical Sciences, Liverpool John Moores University, Liverpool, UK;School of Computing and Mathematical Sciences, Liverpool John Moores University, Liverpool, UK;School of Computing and Mathematical Sciences, Liverpool John Moores University, Liverpool, UK;School of Computing and Mathematical Sciences, Liverpool John Moores University, Liverpool, UK

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The currently emerging large-scale complex networks and networks of networks are becoming apparent in the pervasive supply of seamless and transparent access to heterogeneous resources and services such as network domains, applications, services and storage owned by multiple organizations. The dynamics and heterogeneous environments involved, however, pose many challenges for controlling and balancing resource access, composition and deployment across complex grid and network infrastructures. In this paper, a scheme is proposed that gives a distributed load-balancing scheme by generating almost regular resource allocation networks. This network system is self-organized and depends only on local information for load distribution and resource discovery. The in-degree of each node refers to its free resources, and the job assignment and resource discovery processes required for load-balancing are accomplished by using fitted random sampling. Simulation results show that the generated network system provides an effective, scalable, and reliable load-balancing scheme for the distributed resources in grids and networks. The proposed solution is tested with real world data and the performance is tested against a recently reported distributed algorithm for load balancing.