Provided by: International Journal of Advanced Networking and Applications (IJANA)
Date Added: Nov 2009
In this paper, the authors consider a distributed computer system in War drop 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 paper examines numerically some examples around the Braess-like paradox in a distributed computer system.