We present, analyze, and measure a new algorithm to perform decentralized load balancing of computing jobs in computational Peer-2-Peer (P2P) grids. The unstructured P2P network consists of nodes which only know about their nearest neighbors as defined by a one hop communication path. With limited local information, our algorithm converges to a global load balancing state. We demonstrate the algorithm convergence both by simulations and by theoretical analysis.
Citation:
Jie Hu, Raymond Klefstad, "Decentralized Load Balancing on Unstructured Peer-2-Peer Computing Grids," nca, pp.247-250, Fifth IEEE International Symposium on Network Computing and Applications (NCA'06), 2006