Probing multiple node-disjoint paths using multi-labelled tree traversing
International Journal of Autonomous and Adaptive Communications Systems
Integrating categorical resource types into a P2P desktop grid system
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Resource allocation in decentralised computational systems: an evolutionary market-based approach
Autonomous Agents and Multi-Agent Systems
A self-organization mechanism based on cross-entropy method for P2P-like applications
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Autonomic load balancing mechanisms in the P2P desktop grid
Proceedings of the 2013 ACM Cloud and Autonomic Computing Conference
Cooperative scheduling mechanism for large-scale peer-to-peer computing systems
Journal of Network and Computer Applications
| Hi-index | 0.00 |
We present a novel framework, called balanced overlay networks (BON), that provides scalable, decentralized load balancing for distributed computing using large-scale pools of heterogeneous computers. Fundamentally, BON encodes the information about each node's available computational resources in the structure of the links connecting the nodes in the network. This distributed encoding is self-organized, with each node managing its in-degree and local connectivity via random-walk sampling. Assignment of incoming jobs to nodes with the most free resources is also accomplished by sampling the nodes via short random walks. Extensive simulations show that the resulting highly dynamic and self-organized graph structure can efficiently balance computational load throughout large-scale networks. These simulations cover a wide spectrum of cases, including significant heterogeneity in available computing resources and high burstiness in incoming load. Prior analytical results show BON's scalability for truly large-scale networks; under certain ideal conditions, the network structure converges to Erdos-Renyi (ER) random graphs. Our simulation results, however, show that the algorithm does much better, and the structures seem to approach the ideal case of d-regular random graphs. We also make a connection between highly-loaded BON and the well-known ball-bin randomized load balancing framework.