Data networks
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
On the existence of equilibria in noncooperative optimal flow control
Journal of the ACM (JACM)
Making greed work in networks: a game-theoretic analysis of switch service disciplines
IEEE/ACM Transactions on Networking (TON)
Journal of the ACM (JACM)
Selfish traffic allocation for server farms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Routing into two parallel links: game-theoretic distributed algorithms
Journal of Parallel and Distributed Computing
A game-theoretic approach towards congestion control in communication networks
ACM SIGCOMM Computer Communication Review
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Fair and efficient router congestion control
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Nashification and the coordination ratio for a selfish routing game
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Resource pricing and the evolution of congestion control
Automatica (Journal of IFAC)
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
| Hi-index | 5.23 |
We consider the problem of Internet switching, where traffic is generated by selfish users. We study a packetized (TCP-like) traffic model, which is more accurate than the widely used fluid model. We assume that routers have First-In-First-Out (FIFO) buffers of bounded capacity managed by the drop-tail policy. The utility of each user depends on its goodput and the congestion level. Since selfish users try to maximize their own utility disregarding the system objectives, we study Nash equilibria that correspond to a steady state of the system. We quantify the degradation in the network performance called the price of anarchy resulting from such selfish behavior. We show that for a single bottleneck buffer, the price of anarchy is proportional to the number of users. Then we propose a simple modification of the Random Early Detection (RED) drop policy, which reduces the price of anarchy to a constant. We demonstrate that a Nash equilibrium can be reached if all users deploy TCP Vegas as their transport protocol under the drop-tail policy. We also consider some natural extensions of our model including the case of multiple Quality of Service (QoS) requirements, routing on parallel links and general networks with multiple bottlenecks.