Congestion Control Algorithms in High Speed Telecommunication Networks

Modern telecommunication and computer networks, including the Internet, are being designed for fast transmission of large amounts of data, for which Congestion Control Algorithms (CCAs) are very important. Without proper CCAs, congestion collapse of such networks is a real possibility. Random tele-traffic is a heterogeneous mixture of streams of data packets that have different quality-of-service requirements. By buffering submitted packets at gateway nodes we can regulate the rates at which data packets enter the network, although this may increase the overall packet delays to an unacceptable level. Therefore it is increasingly important to develop gateway mechanisms that are able to keep throughput of a network high, while maintaining sufficiently small average queue lengths. Several algorithms proposed recently try to provide an efficient solution to the problem. In one of these, Active Queue Management (AQM) with Explicit Congestion Notification (ECN), packets generated by different data sources are marked at the network’s gateways. In other algorithms, packets are dropped to avoid and control congestion at gateways. Thus, different senders of data can be required to reduce their traffic volume if needed. Communication with original data senders is maintained by returning marked acknowledgement packets. This paper presents a brief and breadth wise survey of major CCAs designed to operate at the gateway routers of multimedia telecommunication networks.

[1]  Paul E. McKenney,et al.  Stochastic fairness queueing , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[2]  Donald F. Towsley,et al.  On designing improved controllers for AQM routers supporting TCP flows , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  Rayadurgam Srikant,et al.  Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management , 2001, SIGCOMM.

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

[5]  Kang G. Shin,et al.  A self-configuring RED gateway , 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).

[6]  T. V. Lakshman,et al.  SRED: stabilized RED , 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).

[7]  David D. Clark,et al.  Explicit allocation of best-effort packet delivery service , 1998, TNET.

[8]  Leandros Tassiulas,et al.  Balanced-RED: An Algorithm to Achieve Fairness in the Internet , 1999 .

[9]  K. K. Ramakrishnan,et al.  Gateway Congestion Control Survey , 1991, RFC.

[10]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[11]  Victor Firoiu,et al.  A study of active queue management for congestion control , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[12]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[13]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[14]  Steven H. Low,et al.  REM: active queue management , 2001, IEEE Network.

[15]  Sally Floyd,et al.  Adaptive RED: An Algorithm for Increasing the Robustness of RED's Active Queue Management , 2001 .

[16]  Peter C. Young,et al.  Recursive Estimation and Time Series Analysis , 1984 .

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

[18]  Wu-chang Fengy,et al.  BLUE: A New Class of Active Queue Management Algorithms , 1999 .

[19]  B. Barden.  Recommendations on queue management and congestion avoidance in the Internet , 1998 .

[20]  Ratul Mahajan,et al.  Controlling high-bandwidth flows at the congested router , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[21]  Konstantinos Psounis,et al.  CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[23]  Nihal Pekergin.  Stochastic bounds on delays of fair queueing algorithms , 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).

[24]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

[25]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

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