## Network Buffer Requirements of the Rate-Based Control Mechanism for ABR Services (1995)

Venue: | in Proc. of IEEE INFOCOM |

Citations: | 36 - 4 self |

### BibTeX

@INPROCEEDINGS{Ritter95networkbuffer,

author = {Michael Ritter},

title = {Network Buffer Requirements of the Rate-Based Control Mechanism for ABR Services},

booktitle = {in Proc. of IEEE INFOCOM},

year = {1995},

pages = {1190--1197}

}

### OpenURL

### Abstract

In ATM networks congestion control plays an essential role to support different quality of service guarantees for a large variety of traffic types. While for real-time communications, such as CBR and VBR services, a preventive open-loop congestion control mechanism is applied, a reactive closed-loop mechanism has been suggested for the ABR service class, which was introduced aiming at data communication applications. This paper presents a performance analysis of the ratebased congestion control mechanism developed by the ATM Forum. Using a differential equation approach for the computation of the evolution of the allowed cell rate and the buffer content during steady state, we derive closed-form expressions to estimate the maximum buffer lengths. These expressions can be formulated for steady-state conditions as well as for transient phases. In our approach, scenarios with and without priority for the resource management cells are considered. From numerical examples we conclude that an...

### Citations

148 |
Fendick, “The rate-based flow control framework for the available bit rate ATM service
- Bonomi, W
- 1995
(Show Context)
Citation Context ...p congestion control is applied, which is a reactive control mechanism that dynamically regulates the allowed cell transmission rate of each ABR connection using feedback information from the network =-=[4]-=-. This mechanism was developed by the Traffic Management Group of the ATM Forum and operates on an end-to-end basis. It combines features from the Forward Explicit Congestion Notifications(FECN) and B... |

133 |
ATM User-Network Interface Specification Version 3.0
- Forum
- 1993
(Show Context)
Citation Context ...ording to the current congestion status of the network. These reasons have led to the definition of another service type mainly for data communications, the so-called Available Bit Rate (ABR) service =-=[1]-=-. To support the ABR service, a closed-loop congestion control is applied, which is a reactive control mechanism that dynamically regulates the allowed cell transmission rate of each ABR connection us... |

85 | A note on the power of threshold circuits - Allender - 1989 |

71 |
On closed-loop rate control for ATM cell relay networks
- Yin, Hluchyi
- 1994
(Show Context)
Citation Context ...e to estimate the maximum buffer content. The additive increase and the multiplicative decrease of the source rates can be modeled using differential equations. Such an approach has been used e.g. in =-=[3, 5, 12, 13, 14]-=-. The control mechanisms considered in these papers differ, however, from the one developed by the ATM Forum. Furthermore, simple formulae for the maximum buffer content are not derived in these paper... |

68 |
Traffic Management Specification: Version 4.0
- Forum
- 1996
(Show Context)
Citation Context ..., we derive simple formulae to estimate the maximum buffer lengths for the closed-loop congestion control mechanism proposed in the draft version of the ATM Forum Traffic Management Specification 4.0 =-=[2]-=-. We look at network configurations with and without priority for the resource management cells. Besides of the steady-state, we consider transient phases occurring when the available transmission cap... |

57 | Rate-based congestion control for ATM networks
- Ohsaki, Murata, et al.
- 1995
(Show Context)
Citation Context ...not increase its rate. Furthermore, backward RM cells may be generated by a switch. These options are not considered in this paper. A detailed description of switch architectures can be found e.g. in =-=[12]-=-. 3 Steady state analysis Due to the feedback delay, the ACR of each ABR source and the switch buffer lengths show a dynamical behavior. In this section, we briefly outline an analytical method, which... |

54 |
Traffic management for ATM local area networks
- Newman
- 1994
(Show Context)
Citation Context ...em designers. Two different congestion control strategies have been considered for ATM networks. Depending on the service type of a connection, an open-loop or a closed-loop control mechanism is used =-=[11]-=-. The first one, the open-loop mechanism, is applied for CBR and VBR connections and limits each connection 's usable bandwidth according to a number of source traffic descriptors negotiated at connec... |

44 |
Dynamic Behavior of Rate-based Flow Control Mechanisms
- Bolot, Shankar
- 1990
(Show Context)
Citation Context ...e to estimate the maximum buffer content. The additive increase and the multiplicative decrease of the source rates can be modeled using differential equations. Such an approach has been used e.g. in =-=[3, 5, 12, 13, 14]-=-. The control mechanisms considered in these papers differ, however, from the one developed by the ATM Forum. Furthermore, simple formulae for the maximum buffer content are not derived in these paper... |

44 | Folded Petersen cube networks: New competitors for the hypercubes - Ohring, Das - 1996 |

36 | Analysis of dynamic congestion control protocols - a fokker-planck approximation
- Mukherjee, Strikwerda
- 1991
(Show Context)
Citation Context ...veloped by the ATM Forum. Furthermore, simple formulae for the maximum buffer content are not derived in these papers. The convergence to a steady state, which is not necessarily given, is studied in =-=[7, 10]-=-. Other papers on feedback control, which are only loosely related to the mechanism investigated here, are e.g. [8, 9, 15]. For our analysis we make use of the network model depicted in Figure 1. A nu... |

35 | Discrete-time analysis technique and application to usage parameter control modelling in ATM systems - Tran-Gia - 1993 |

34 |
Analysis of a rate-based control strategy with delayed feedback
- Rodrigues, Fendick, et al.
(Show Context)
Citation Context ...veloped by the ATM Forum. Furthermore, simple formulae for the maximum buffer content are not derived in these papers. The convergence to a steady state, which is not necessarily given, is studied in =-=[7, 10]-=-. Other papers on feedback control, which are only loosely related to the mechanism investigated here, are e.g. [8, 9, 15]. For our analysis we make use of the network model depicted in Figure 1. A nu... |

33 | Statistical properties of MPEG video tra c and their impact on tra c modeling in ATM systems - Rose - 1995 |

32 | On the power of number-theoretic operations with respect to counting - Hertrampf, Vollmer, et al. - 1995 |

30 | Dimensioning of a peak cell rate monitor algorithm using discrete-time analysis - Hubner - 1993 |

29 | On Balanced vs. Unbalanced Computation Trees - Hertrampf, Wagner - 1994 |

27 |
A dynamic rate control mechanism for source coded tra c in a fast packet network
- Yin, Hluchyi
(Show Context)
Citation Context ...The convergence to a steady state, which is not necessarily given, is studied in [7, 10]. Other papers on feedback control, which are only loosely related to the mechanism investigated here, are e.g. =-=[8, 9, 15]-=-. For our analysis we make use of the network model depicted in Figure 1. A number of N ABR traffic sources are connected to their destination via a single bottleneck link. The buffer in the ATM switc... |

26 | Steady-State Analysis of the Rate-Based Congestion Control Mechanism for
- Ritter
- 1995
(Show Context)
Citation Context ...e to estimate the maximum buffer content. The additive increase and the multiplicative decrease of the source rates can be modeled using differential equations. Such an approach has been used e.g. in =-=[3, 5, 12, 13, 14]-=-. The control mechanisms considered in these papers differ, however, from the one developed by the ATM Forum. Furthermore, simple formulae for the maximum buffer content are not derived in these paper... |

26 | Incomplete Hypercubes: Embeddings of Tree-Related Networks - Öhring, Das - 1995 |

25 | Analysis of polling systems with general input process and nite capacity - Tran-Gia - 1990 |

25 | Growing Context-Sensitive Languages and Automata - Buntrock - 1993 |

24 | Performance analysis of the CRM a-protocol in high-speed networks. Dezember - Dittmann - 1990 |

24 | Performance analysis of a batch service system operating in pull mode - Grob - 1991 |

24 | Classes of counting functions and complexity theoretic operators - Wagner - 1991 |

24 | Discrete-time analysis of the output process of an atm multiplexer with periodic input - Hubner - 1991 |

24 | Vector language: Simple description of hard instances. Oktober - Wagner - 1992 |

23 | Application of the discrete transforms in performance modeling and analysis. Februar - Tran-Gia - 1989 |

23 | Die Vektor-Sprache: Einfachste Mittel zur kompakten Beschreibung endlicher Objekte - Wagner - 1989 |

23 | A transformation system for chain code picture languages: Properties and algorithms - Gutbrod - 1990 |

23 | und P. Tran-Gia. Performance analysis of a batch service queue arising out of manufacturing systems modeling - Gold - 1990 |

23 | Communication network routing using neural nets { numerical aspects and alternative approaches. Juli - Mandel - 1991 |

23 | On complexity classes and algorithmically random languages - Book, Wagner - 1991 |

23 | A graphical user interface for genetic algorithms - Dabs, Schoof - 1995 |

22 | Bounded query classes. Februar - Wagner - 1989 |

22 | Relations among mod-classes. Februar - Hertrampf - 1989 |

22 | Number-of-query hierarchies. Februar - Wagner - 1989 |

22 | und Th. Stock. Approximate performance analysis of the DQDB access protocol - Tran-Gia - 1989 |

22 | Workshop uber Komplexitatstheorie, e ziente Algorithmen und Datenstrukturen - Wagner - 1989 |

22 | Allender und U. Hertrampf. On the power of uniform families of constant depth threshold circuits. Februar - W - 1990 |

22 | Hertrampf und C. Meinel. Structure and importance of logspace-MOD-classes. Juli - Buntrock, Damm, et al. - 1990 |

22 | Complexity and approximation theoretical properties of rational functions which maptwo intervals into two other ones - Huckenbeck - 1990 |

22 | On random oracle separations - Book - 1990 |

22 | und G. Bleckert. Analysis of a batch service system with two heterogeneous servers - Gold - 1991 |

22 | Structure and performance of neural nets in broadband system admission control - Gropp - 1991 |

22 | und K. Lorys. On growing context-sensitive languages. Januar - Buntrock - 1992 |

22 | On a generalization of the bellman-ford-algorithm for acyclic graphs - Huckenbeck - 1992 |

22 | Cost-bounded paths in networks of pipes with valves - Huckenbeck - 1992 |

22 | On dynamic and modular embeddings into hyper de Bruijn networks - Ohring - 1992 |

22 | und M. Tins. An intelligent tutoring system for classi cation problem solving - Poeck - 1992 |

22 | Analysis of machine breakdown models. Januar - Gihr, Heilmann - 1993 |