Congestion control mechanisms and the best effort service model

In the last few years there has been considerable research toward extending the Internet architecture to provide quality of service guarantees for the emerging real-time multimedia applications. QoS provision is a rather controversial endeavour. At one end of the spectrum there were proposals for reservations and per-flow state in the routers. These models did not flourish due to the network's heterogeneity the complexity of the mechanisms involved, and scalability problems. At the other end, proposals advocating that an overprovisioned best effort network will solve all the problems are not quite convincing either. The authors believe that more control is clearly needed for protecting best effort service. An important requirement is to prevent congestion collapse, keep congestion levels low, and guarantee fairness. Appropriate control structures in a best effort service network could even be used for introducing differentiation. This could be achieved without sacrificing the best effort nature of the Internet or stressing its architecture beyond its limits and original design principles. We revisit the best effort service model and the problem of congestion while focusing on the importance of cooperative resource sharing to the Internet's success, and review the congestion control principles and mechanisms which facilitate Internet resource sharing.

[1]  W. Hamilton,et al.  The Evolution of Cooperation , 1984 .

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

[3]  Parameswaran Ramanathan,et al.  Proportional differentiated services: delay differentiation and packet scheduling , 1999, SIGCOMM '99.

[4]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[5]  S. Shenker Fundamental Design Issues for the Future Internet , 1995 .

[6]  KeshavSrinivasan A control-theoretic approach to flow control , 1991 .

[7]  David D. Clark,et al.  The design philosophy of the DARPA internet protocols , 1988, SIGCOMM '88.

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

[9]  Jon Postel,et al.  Internet Control Message Protocol , 1981, RFC.

[10]  John Nagle,et al.  Congestion control in IP/TCP internetworks , 1984, CCRV.

[11]  T. V. Lakshman,et al.  The drop from front strategy in TCP and in TCP over ATM , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[12]  T. V. Lakshman,et al.  Efficient Active Queue Management for Internet Routers , 1997 .

[13]  Andrew M. Odlyzko,et al.  Paris metro pricing for the internet , 1999, EC '99.

[14]  G. Pal,et al.  Congestion control , 1995 .

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

[16]  Raj Jain,et al.  Congestion control with explicit rate indication , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[17]  Eman Salaheddin Hashem,et al.  Analysis of Random Drop for Gateway Congestion Control , 1989 .

[18]  Srinivasan Keshav,et al.  A control-theoretic approach to flow control , 1991, SIGCOMM '91.

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

[20]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[21]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[22]  Dinesh C. Verma,et al.  A policy framework for integrated and differentiated services in the Internet , 1999, IEEE Netw..

[23]  Rene Leonardo Cruz A Calculus for Network Delay and a Note on Topologies of Interconnection Networks , 1987 .

[24]  W. Richard Stevens,et al.  TCP/IP Illustrated, Volume 1: The Protocols , 1994 .

[25]  Robert T. Braden,et al.  Requirements for Internet Hosts - Communication Layers , 1989, RFC.

[26]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

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

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

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

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

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

[32]  QueueingJon,et al.  WF 2 Q : Worst-case Fair Weighted Fair , 1996 .

[33]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

[34]  Deborah Estrin,et al.  Recommendations on Queue Management and Congestion Avoidance in the Internet , 1998, RFC.

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

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

[37]  Van Jacobson,et al.  Traffic phase effects in packet-switched gateways , 1991, CCRV.

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

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

[40]  RamanathanParameswaran,et al.  Proportional differentiated services , 1999 .

[41]  J. Turner,et al.  New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.

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

[43]  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.

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

[45]  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).

[46]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[47]  Hairong Sun,et al.  Quality of service: delivering QoS on the internet and in corporate networks; P. Ferguson, G. Huston , 1999, Comput. Commun..

[48]  John Nagle,et al.  On Packet Switches with Infinite Storage , 1985, IEEE Trans. Commun..