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)
The designer's perspective to atomic noncooperative networks
IEEE/ACM Transactions on Networking (TON)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
Journal of the ACM (JACM)
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Designing Networks for Selfish Users is Hard
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Computers and Operations Research
Architecting noncooperative networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We consider a distributed computer system in Wardrop equilibrium, i.e., situations where no user can reduce its own response time by unilaterally choosing another path, if all the other users retain their present paths. The Braess paradox is a famous example of paradoxical cases where adding capacity to a network degrades the performance of all users. This study examines numerically some examples around the Braess-like paradox in a distributed computer system. We found that Braess's paradox can occur, namely in equilibrium the mean job response time in the network after adding a communication line for the sharing of jobs between nodes, for some system parameter setting, can be greater than the mean job response time in the network before adding the communication line. Indeed, two different types of paradox called weak and strong paradox have been characterized. In the range of parameter values examined, the worst case ratio of performance degradation obtained in the examined network model is about 75% and 65% for the cases of weak and strong paradox respectively.