A game-theoretic approach towards congestion control in communication networks

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.

[1]  E. L. Hahne,et al.  Dynamic queue length thresholds in a shared memory ATM switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[2]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[3]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

[4]  Lixia Zhang,et al.  VirtualClock: a new traffic control algorithm for packet-switched networks , 1991, TOCS.

[5]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[6]  T. V. Lakshman,et al.  Buffer management schemes for supporting TCP in gigabit routers with per-flow queueing , 1999, IEEE J. Sel. Areas Commun..

[7]  Cui-Qing Yang,et al.  A taxonomy for congestion control algorithms in packet switching networks , 1995, IEEE Netw..

[8]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[9]  Anujan Varma,et al.  Design and analysis of frame-based fair queueing: a new traffic scheduling algorithm for packet-switched networks , 1996, SIGMETRICS '96.

[10]  Sally Floyd,et al.  TCP Selective Acknowledgement Options , 1996 .

[11]  Larry L. Peterson,et al.  TCP Vegas: new techniques for congestion detection and avoidance , 1994 .

[12]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM '96.

[13]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[14]  Te-Wei Ho.  A Game-Theoretic Approach Towards Congestion Control in Communication Networks , 2003 .

[15]  Jean C. Walrand,et al.  Analysis and comparison of TCP Reno and Vegas , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[16]  Sally Floyd,et al.  Congestion Control Principles , 2000, RFC.

[17]  Jon Postel,et al.  Something a Host Could Do with Source Quench: The Source Quench Introduced Delay (SQuID) , 1987, RFC.

[18]  Matthew Mathis,et al.  Forward acknowledgement: refining TCP congestion control , 1996, SIGCOMM '96.

[19]  Anujan Varma,et al.  Hardware implementation of fair queuing algorithms for asynchronous transfer mode networks , 1997 .

[20]  K. K. Ramakrishnan,et al.  A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer , 1988, SIGCOMM '88.

[21]  K. K. Ramakrishnan,et al.  A Proposal to add Explicit Congestion Notification (ECN) to IP , 1999, RFC.

[22]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[23]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM 1996.

[24]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

[25]  Mischa Schwartz,et al.  ACM SIGCOMM computer communication review , 2001, CCRV.

[26]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[27]  Scott Shenker,et al.  Making greed work in networks: a game-theoretic analysis of switch service disciplines , 1994 .

[28]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[29]  Raj Jain,et al.  ERICA Switch Algorithm: A Complete Description , 1996 .

[30]  Trevor Blackwell,et al.  Credit-based flow control for ATM networks: credit update protocol, adaptive credit allocation and statistical multiplexing , 1994, SIGCOMM 1994.

[31]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[32]  Lixia Zhang.  VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks , 1991, ACM Trans. Comput. Syst..

[33]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[34]  Madhu Sudan,et al.  Priority encoding transmission , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.