Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
On complexity as bounded rationality (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Randomized algorithms
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Virtual path bandwidth allocation in multiuser networks
IEEE/ACM Transactions on Networking (TON)
Dynamics of IP traffic: a study of the role of variability and the impact of control
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Journal of the ACM (JACM)
How unfair is optimal routing?
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the relationship between file sizes, transport protocols, and self-similar network traffic
ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
Stackelberg Scheduling Strategies
SIAM Journal on Computing
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
On the severity of Braess's paradox: designing networks for selfish users is hard
Journal of Computer and System Sciences - Special issue on FOCS 2001
Tight bounds for worst-case equilibria
ACM Transactions on Algorithms (TALG)
Algorithmica
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Hi-index | 0.00 |
We study the price of selfish routing in noncooperative networks like the Internet. In particular, we investigate the price of selfish routing using the price of anarchy (a.k.a. the coordination ratio) and other (e.g., bicriteria) measures in the recently introduced game theoretic parallel links network model of Koutsoupias and Papadimitriou. We generalize this model toward general, monotone families of cost functions and cost functions from queueing theory. A summary of our main results for general, monotone cost functions is as follows: 1. We give an exact characterization of all cost functions having a bounded/unbounded price of anarchy. For example, the price of anarchy for cost functions describing the expected delay in queueing systems is unbounded. 2. We show that an unbounded price of anarchy implies an extremely high performance degradation under bicriteria measures. In fact, the price of selfish routing can be as high as a bandwidth degradation by a factor that is linear in the network size. 3. We separate the game theoretic (integral) allocation model from the (fractional) flow model by demonstrating that even a very small or negligible amount of integrality can lead to a dramatic performance degradation. 4. We unify recent results on selfish routing under different objectives by showing that an unbounded price of anarchy under the min-max objective implies an unbounded price of anarchy under the average cost objective and vice versa. Our special focus lies on cost functions describing the behavior of Web servers that can open only a limited number of Transmission Control Protocol (TCP) connections. In particular, we compare the performance of queueing systems that serve all incoming requests with servers that reject requests in case of overload. Our analysis indicates that all queueing systems without rejection cannot give any reasonable guarantee on the expected delay of requests under selfish routing even when the injected load is far away from the capacity of the system. In contrast, Web server farms that are allowed to reject requests can guarantee a high quality of service for every individual request stream even under relatively high injection rates.