Non-monetary fair scheduling: a cooperative game theory approach
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
In this paper we consider the problem of designing loadbalancing protocols in distributed systems where the participants(e.g. computers, users) are capable of manipulatingthe load allocation algorithm in their own interest.Using techniques from mechanism design theory we designa mechanism for fair load balancing in heterogeneous distributedsystems. We prove that our mechanism is truthfuland satisfies the voluntary participation condition. Basedon the proposed mechanism we derive a fair load balancingprotocol called FAIR-LBM. Finally, we study the effectivenessof our protocol by simulations.