Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems
IEEE Transactions on Software Engineering
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Design and Mathematical Analysis of Agent-Based Systems
FAABS '00 Proceedings of the First International Workshop on Formal Approaches to Agent-Based Systems-Revised Papers
Anthill: A Framework for the Development of Agent-Based Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Fast convergence of selfish rerouting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed selfish load balancing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Noncooperative load balancing in distributed systems
Journal of Parallel and Distributed Computing
Information Sciences: an International Journal
Selfish Grids: Game-Theoretic Modeling and NAS/PSA Benchmark Evaluation
IEEE Transactions on Parallel and Distributed Systems
Game-Theoretic Approach for Load Balancing in Computational Grids
IEEE Transactions on Parallel and Distributed Systems
Application of load balancing based on symmetric balanced incomplete block design to random networks
Information Sciences: an International Journal
A Cooperative Game Framework for QoS Guided Job Allocation Schemes in Grids
IEEE Transactions on Computers
Cooperative load balancing in distributed systems
Concurrency and Computation: Practice & Experience
A Pure Nash Equilibrium-Based Game Theoretical Method for Data Replication across Multiple Servers
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Parallel and Distributed Systems
Messor: load-balancing through a swarm of autonomous agents
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Toward self-organizing, self-repairing and resilient distributed systems
Future directions in distributed computing
Uncoordinated load balancing and congestion games in p2p systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Information Sciences: an International Journal
| Hi-index | 0.07 |
Load balancers distribute workload across multiple nodes based on a variation of the round robin algorithm, or a more complex algorithm that optimizes a specified objective or allows for horizontal scalability and higher availability. In this paper, we investigate whether robust load balancing can be achieved using a local co-operative mechanism between the resources (nodes). The local aspect of the mechanism implies that each node interacts with a small subset of the nodes that define its neighborhood. The co-operative aspect of the mechanism implies that a node may offload some of load to its neighbor nodes that have lesser load or accept jobs from neighbor nodes that have higher load. Each node is thus only aware of the state of its neighboring nodes and there is no central entity that has the knowledge of the state of all the nodes. We model the overall mechanism of load balancing based on local interactions as a congestion game and show that convergence to the Nash equilibrium is possible using only local interactions. We derive worst case bounds on the number of transfers (time) required to achieve global load balancing under this setup. We also include simulation results to demonstrate emergent global load balancing based only on local interactions and local information.