A game-theoretic approach towards congestion control in communication networks
- 1 July 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 32 (3), 47-61
- https://doi.org/10.1145/571697.571723
Abstract
Most of the end-to-end congestion control schemes are "voluntary" in nature and critically depend on end-user cooperation. We show that in the presence of selfish users, all such schemes will inevitably lead to a congestion collapse. Router and switch mechanisms such as service disciplines and buffer management policies determine the sharing of resources during congestion. We show, using a game-theoretic approach, that all currently proposed mechanisms, either encourage the behaviour that leads to congestion or are oblivious to it.We propose a class of service disciplines called the Diminishing Weight Schedulers (DWS) that punish misbehaving users and reward congestion avoiding well behaved users. We also propose a sample service discipline called the Rate Inverse Scheduling (RIS) from the class of DWS schedulers. With DWS schedulers deployed in the network, max-min fair rates constitute a unique Nash and Stackelberg Equilibrium. We show that RIS solves the problems of excessive congestion due to unresponsive flows, aggressive versions of TCP, multiple parallel connections and is also fair to TCP.Keywords
This publication has 19 references indexed in Scilit:
- Dynamic queue length thresholds in a shared memory ATM switchPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Priority encoding transmissionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Promoting the use of end-to-end congestion control in the InternetIEEE/ACM Transactions on Networking, 1999
- Dynamics of random early detectionPublished by Association for Computing Machinery (ACM) ,1997
- Forward acknowledgementACM SIGCOMM Computer Communication Review, 1996
- Credit-based flow control for ATM networksPublished by Association for Computing Machinery (ACM) ,1994
- TCP VegasPublished by Association for Computing Machinery (ACM) ,1994
- Random early detection gateways for congestion avoidanceIEEE/ACM Transactions on Networking, 1993
- Congestion avoidance and controlACM SIGCOMM Computer Communication Review, 1988
- Bottleneck Flow ControlIEEE Transactions on Communications, 1981