Abstract-Computational grids are promising next-generation computing platforms for large-scale problems in science and engineering. Grids are large-scale computing systems composed of geographically distributed resources (computers, storage etc.) owned by self interested agents or organizations. These agents may manipulate the resource allocation algorithm in their own benefit, and their selfish behavior may lead to severe performance degradation and poor efficiency. In this paper, we investigate the problem of designing protocols for resource allocation involving selfish agents. Solving this kind of problems is the object of mechanism design theory. Using this theory, we design a truthful mechanism for solving the static load balancing problem in heterogeneous distributed systems. We prove that using the optimal allocation algorithm the output function admits a truthful payment scheme satisfying voluntary participation. We derive a protocol that implements our mechanism and present experiments to show its effectiveness. Index Terms-Distributed systems, game theory, mechanism design, static load balancing.
Grosu and Chronopoulos REF designed an agent based resource allocation protocol to solve static load balancing problem in large scale heterogeneous distributed computing system (Grid).
Algorithmic mechanism design for load balancing in distributed systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
Computer Science