A Proportional Feedback Scheme for ATM Networks

Abstract Available bit rate (ABR) service class is proposed by Asynchronous Transfer Mode (ATM) Forum to provide the “best-effort” services like traditional TCP/IP traffic. It is designed to make use of the remaining bandwidth not used by VBR and CBR. However, the bursty nature of ABR traffic makes it difficult to prevent buffers on ATM switches from overflowing. A number of schemes have been proposed for ABR traffic control. In this paper, a proportional scheme that is rate-based hop-by-hop flow control is proposed. A mathematical model is built to analyze the hop-by-hop flow control scheme. It is shown the scheme can utilize full bandwidth without any cell loss. It is also shown the scheme has low queuing delay and fast transient response.

[1]  Samuel P. Morgan.  Queuing disciplines and passive congestion control in byte-stream networks , 1991, IEEE Trans. Commun..

[2]  Kai-Yeung Siu,et al.  Intelligent congestion control for ABR service in ATM networks , 1994, CCRV.

[3]  George Varghese,et al.  Reliable and Efficient Hop-by-Hop Flow Control , 1995, IEEE J. Sel. Areas Commun..

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

[5]  H. T. Kung,et al.  Receiver-oriented adaptive buffer allocation in credit-based flow control for ATM networks , 1995, Proceedings of INFOCOM'95.

[6]  Srinivasan Keshav.  A control-theoretic approach to flow control , 1991, SIGCOMM 1991.

[7]  Robert Morris,et al.  Use of Link-by-Link Flow Control in Maximizing ATM Network Performance: Simulation Results , 1993 .

[8]  H. T. Kung,et al.  The FCVC (flow-controlled virtual channels) proposal for ATM networks: a summary , 1993, 1993 International Conference on Network Protocols.

[9]  Atm Forum.  ATM user-network interface (UNI) specification : version 3.1 , 1993 .

[10]  E. L. Hahne,et al.  Round-Robin Scheduling for Max-Min Fairness in Data Networks , 1991, IEEE J. Sel. Areas Commun..

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

[12]  Samuel P. Morgan.  Queueing disciplines and passive congestion control in byte-stream networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[13]  Manolis Katevenis,et al.  Fast switching and fair control of congested flow in broadband networks , 1987, IEEE J. Sel. Areas Commun..

[14]  Scott Shenker,et al.  A theoretical analysis of feedback flow control , 1990, SIGCOMM '90.

[15]  Scott Shenker,et al.  Congestion control for best-effort service: why we need a new paradigm , 1996, IEEE Netw..

[16]  Scott Shenker,et al.  Some observations on the dynamics of a congestion control algorithm , 1990, CCRV.