Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
Data networks
An Algorithm for Optimal Static Load Balancing in Distributed Computer Systems
IEEE Transactions on Computers
Optimal load balancing in distributed computer systems
Optimal load balancing in distributed computer systems
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Routing into two parallel links: game-theoretic distributed algorithms
Journal of Parallel and Distributed Computing
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
A network pricing game for selfish traffic
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Noncooperative load balancing in distributed systems
Journal of Parallel and Distributed Computing
Performance of server selection algorithms for content replication networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
The effect of local scheduling in load balancing designs
ACM SIGMETRICS Performance Evaluation Review
Performance of wireless heterogeneous networks with always-best-connected users
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
| Hi-index | 0.00 |
We investigate the worst case delay ratio between the Nash equilibrium and the social optimum in networks of N parallel links (routes) with unbounded delay functions. We compute this ratio, known as the "price of anarchy", for the case when the link delay functions correspond to M/M/ 1-FCFS or M/G/ 1-PS. For this problem, we find that the price of anarchy depends on the network topology in the sense that it is precisely equal to N. We then extend our results to M/G/ 1-FCFS and G/G/ 1-FCFS delay functions and compute the price of anarchy in a heavy load regime. Our results indicate that, even in very simple topological settings, the price of selfish behavior can potentially be very high.