Article ID Journal Published Year Pages File Type
439351 Theoretical Computer Science 2006 10 Pages PDF
Abstract

We investigate the problem of routing traffic through a congested network in an environment of non-cooperative users. We use the worst-case coordination ratio suggested by Koutsoupias and Papadimitriou to measure the performance degradation due to the lack of a centralized traffic regulating authority. We provide a full characterization of the worst-case coordination ratio in the restricted assignment and unrelated parallel links model. In particular, we quantify the tradeoff between the “negligibility” of the traffic controlled by each user and the worst-case coordination ratio. We analyze both pure and mixed strategies systems and identify the range where their performance is similar.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics