Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems

Authors:
Said Fathy El-Zoghdy;Hisao Kameda;Jie Li
Affiliations:
Doctoral Program in Engineering, University of Tsukuba, Tsukuba, Ibaraki, Japan;Institute of Information Sciences and Electronics, University of Tsukuba, Tsukuba, Ibaraki, Japan;Institute of Information Sciences and Electronics, University of Tsukuba, Tsukuba, Ibaraki, Japan
Venue:
Computers and Operations Research
Year:
2006

Citing 6
Cited 3

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
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
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers

Journal of the ACM (JACM)
Scheduling and Load Balancing in Parallel and Distributed Systems

Scheduling and Load Balancing in Parallel and Distributed Systems

Price of anarchy in non-cooperative load balancing games

Performance Evaluation
Competition in access to content

IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Modeling the impact of horizontal and vertical monopolies in the telecommunication market on the diversity of accessing content

Proceedings of the 24th International Teletraffic Congress

Quantified Score

Hi-index	0.02

Visualization

Abstract

Numerical examples of a Braess-like paradox in which adding capacity to a distributed computer system may degrade the performance of all users in the system under non-cooperative optimization have been reported. Unlike the original Braess paradox, in the models examined, this behavior occurs only in the case of finitely many users and not in the case of infinite number of users and the degree of performance degradation can increase without bound. This study examines numerically some examples around the Braess-like paradox in a distributed computer system. In the numerical examples, it is observed that the worst-case degree of the paradox (WCDP) is largest in complete symmetry. The dependence of the WCDP on some system parameters is also examined.