Closed loop credit-based flow control with internal backpressure in input and output queued switches

A credit-based flow control scheme is very effective for handling cells of the ABR or controlled transfer service class in ATM networks. The properties of immediate ramp-up after congestion and the impossibility of buffer overflow by construction are what makes this method very attractive. For best results, many switches along the route must support flow control, acting as virtual source/destination node. To support closed loops along the route each of these switches must also provide an internal flow control to pass the backpressure from the destinations back to the sources and avoid internal buffer overflow. We treat the interaction of external and internal flow control and the alternatives of internal backpressure mechanisms, emphasizing virtual-output-queued switches. The properties are studied with Petri net models.

[1]  Heinrich Meyr,et al.  An upper bound of the throughput of multirate multiprocessor schedules , 1997, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[2]  Nick McKeown,et al.  Scheduling algorithms for input-queued cell switches , 1996 .

[3]  Nick McKeown,et al.  A practical scheduling algorithm to achieve 100% throughput in input-queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[4]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[5]  H. T. Kung,et al.  Credit-Based Flow Control for ATM Networks , 1994, SIGCOMM 1994.

[6]  Marco Ajmone Marsan,et al.  Modelling with Generalized Stochastic Petri Nets , 1995, PERV.

[7]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

[8]  Raj Jain.  Congestion Control and Traffic Management in ATM Networks: Recent Advances and a Survey , 1996, Comput. Networks ISDN Syst..

[9]  Yuval Tamir,et al.  Symmetric Crossbar Arbiters for VLSI Communication Switches , 1993, IEEE Trans. Parallel Distributed Syst..

[10]  Thomas E. Anderson,et al.  High-speed switch scheduling for local-area networks , 1993, TOCS.

[11]  A. Muller,et al.  Analysis and dimensioning of credit-based flow control for the ABR service in ATM networks , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[12]  Rainer Schoenen,et al.  Weighted Arbitration Algorithms with Priorities for Input-Queued Switches with 100% Throughput , 1999 .

[13]  Sung-Mo Kang,et al.  ABR architecture and simulation for an input-buffered and per-VC queued ATM switch , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[14]  Rainer Schoenen,et al.  Prioritized arbitration for input-queued switches with 100% throughput , 1999, IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462).

[15]  Balaji Prabhakar,et al.  Matching Output Queueing with Combined Input and Output Queueing , 1999 .

[16]  Shie-Yuan Wang,et al.  Zero queueing flow control and applications , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.