Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
An Algorithm for Optimal Static Load Balancing in Distributed Computer Systems
IEEE Transactions on Computers
Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
Congestion resulting from increased capacity in single-server queueing networks
IEEE/ACM Transactions on Networking (TON)
Optimal load balancing in distributed computer systems
Optimal load balancing in distributed computer systems
Load Balancing Problems for Multiclass Jobs in Distributed/Parallel Computer Systems
IEEE Transactions on Computers
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Architecting noncooperative networks
IEEE Journal on Selected Areas in Communications
A survey on networking games in telecommunications
Computers and Operations Research
Computers and Operations Research
A paradox in optimal flow control of M/M/n queues
Computers and Operations Research
PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
Counter-intuitive throughput behaviors in networks under end-to-end control
IEEE/ACM Transactions on Networking (TON)
A survey on networking games in telecommunications
Computers and Operations Research
Computers and Operations Research
A paradox in optimal flow control of M/M/n queues
Computers and Operations Research
Nash equilibrium based fairness
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
| Hi-index | 0.00 |
In completely symmetric systems that have homogeneous nodes (hosts, computers, or processors) with identical arrival processes, an optimal static load balancing scheme does not involve the forwarding of jobs among nodes. Using an appropriate analytic model of a distributed computer system, we examine the following three decision schemes for load balancing: completely distributed, intermediately distributed, and completely centralized. We show that there is no forwarding of jobs in the completely centralized and completely distributed schemes, but that in an intermediately distributed decision scheme, mutual forwarding of jobs among nodes is possible, leading to degradation in system performance for every decision maker. This result appears paradoxical, because by adding communication capacity to the system for the sharing of jobs between nodes, the overall system performance is degraded. We characterize conditions under which such paradoxical behavior occurs, and we give examples in which the degradation of performance may increase without bound. We show that the degradation reduces and finally disappears in the limit as the intermediately distributed decision scheme tends to a completely distributed one.