Acknowledgment bucket scheme for regulating TCP flow over ATM

Performance of TCP traffic and ABR congestion control mechanisms

The broadband integrated services digital networks are based on the ATM technology. As these networks will be deployed gradually, the existing high-speed data services, as Frame Relay and SMDS, will continue to exist and, for interoperability purposes, they will also be supported by the ATM networks. Moreover, ATM networks allows to efficiently support a new service, called available bit rate (ABR) service in the ATM Forum, which requires no bandwidth reservation. When this service is requested, data are transmitted through the network with low priority, being the available network resources shaped dynamically among all the active sources. In this paper, we first discuss how to manage FR and SMDS services in the ATM networks, and report the performance evaluation of the proposed interconnection scenarios; then, we present some preliminary simulation results on the ABR service, whose implementation needs a sophisticated reactive congestion control to obtain an acceptable quality of service.

The available bit rate (ABR) service category has been approved by the ATM Forum to make use of bandwidth available after satisfying the requirements of real-time services. Thus, many flow control algorithms have been proposed within the context of the ABR service. We have proposed a dynamic rate-based flow control (DRFC) scheme with the primary goal of supporting the ABR service effectively and with the additional advantage of simplicity. This paper investigates the behaviour of the DRFC scheme in conjunction with virtual source/virtual destination (VS/VD) technique. The performance is evaluated in terms of allowed cell rates, number of transmitted cells, buffer occupancy, and link utilization. It has been observed that the implementation of VS/VD technique improves the performance with minimum buffer requirements.

In this work we examine the problem of regulating available bit rate (ABR) traffic in an ATM network. A unique feature of ABR service is the requirement that sources be regulated using information from distant ATM nodes. This feature is problematic for source control schemes when the time-delays incurred in the feedback path and the temporal variation in the link capacity at the ATM node are considered. A source rate control algorithm that allows for the coordination of the traffic between sources sharing a congested node is presented. The coefficients of the controller are chosen subject to the minimization of a quadratic performance index. The results of the method are also given.

In this paper we present an abstract, rigorous game-theoretic framework for rate-based control of Available Bit Rate (ABR) services in ATM networks. The framework is based on the idea of the Nash arbitration scheme in cooperative game theory which not only provides the rate settings of users which are Pareto optimal from the network point of view of but are also consistent with the fairness axioms of game theory. We first consider the centralized problem and then show that this procedure can be de-centralized such that users can perform the optimization locally such that the overall rates are network optimal. We then consider the problem of charging of ABR connections considering users’ valuations for the best-effort service. We propose a flat-rate charging policy such that the total network revenue is maximum.

We propose a congestion control algorithm and design a state feedback controller for regulating the congestion of available bit rate (ABR) traffic in asynchronous transfer mode (ATM) networks. ABR service is specified as the rate-based feedback mechanism for congestion control and provides a control signal to throttled sources from a bottleneck node in order to adjust the throttled source rates based on available capacity. Our main purposes are as follows: (1) to design a state feedback controller; (2) to place the closed-loop poles in any desired regions based on a pole placement constraint; (3) to use the LMI (linear matrix inequalities) approach for finding the optimal state feedback gain K. The simulation results show that, under pole placement and LMI approaches, our state feedback congestion controller for ABR traffic in ATM networks can possibly guarantee the system stability, provide no buffer overflow, determine the optimal source traffic rates and place the closed-loop poles in any desired regions as well.

This paper presents the Neural Indicates Explicit Rate (NIER) scheme, in which an artificial neural network (ANN) is used to obtain suitable Explicit Rate (ER) for congestion control of Available Bit Rate (ABR) service in ATM networks. The neural network used in this scheme will monitor the queue status in switches’ buffer and output suitable ER value to be carried by Resource Management (RM) cells to the sources for their rate adjustment. A comprehensive comparison study between the proposed algorithm and two well-known algorithms is done and simulation results prove that the proposed algorithm gives good performance in both LAN and WAN topologies.

This paper investigates the impacts of the fast congestion notification function on branch point switch algorithms for multicast (or point-to-multipoint) available bit rate (ABR) flow control in ATM networks. A new backward resource management (BRM) cell-discarding policy is proposed which controls additional BRM cell overhead due to fast congestion notification. The performance of branch-point algorithms with the proposed fast congestion notification is also compared using simulations. The simulation results show that a fast congestion notification is very effective in a severe overload situation, particularly in an initial period with a higher initial cell rate. The fast congestion notification can be also combined with any branch point algorithm. However, its performance is highly dependent on the underlying basic branch point algorithm employed.

Proposes a predictive congestion control methodology for the available bit rate (ABR) service class in an ATM network for the case of multiple nodes with single buffer scenario. An adaptive controller is developed to control traffic where sources adjust their transmission rates in response to the feedback information from the network nodes. Specifically, the dynamics of the ABR sources with the buffer is modeled as a nonlinear system and an autoregressive moving average based (ARMAX) adaptive controller is designed to predict the explicit values of the transmission rates of the sources so as to prevent network congestion. Stability analysis of the closed-loop system is presented. Simulation results are provided to justify the theoretical conclusions.

A rate-based congestion control algorithm regulates cell emission rate of source end systems based on feedback information from the network. It was standardized by the ATM Forum for application to an ABR (available bit rate) service class. In the standard, two types of congestion notification methods of the switch are specified: EFCI marking and explicit-rate marking. In this paper, we focus on the explicit-rate marking switch. We propose our enhancements on a recently proposed switch algorithm known as the max-min scheme. The main objective of our enhancements is to control the queue length of the switch for preventing cell loss and achieving full link-utilization. We show the effectiveness of our switch algorithm by simulation experiments.

ATM provides a very high speed network infrastructure suitable for local, campus and wide area networks, capable of supporting a broad range of applications. There are still several areas of ATM which require further work. One such area is bandwidth allocation. In essence, bandwidth allocation is required order to guarantee performance for real time traffic connections (e.g. voice and video). On the one hand, peak bandwidth allocation is inefficient. On the other, statistical bandwidth allocation is very difficult, especially a heterogeneous traffic environment. In this paper, we introduce a bandwidth allocation technique based on virtual private networks, which can overcome some of these problems. Another critical area ATM is congestion control of best effort traffic, i.e. traffic which is not allocated any bandwidth, rather, it fills in the bandwidth left over by the guaranteed traffic. Hence the name of ABR (available bit rate) traffic. ABR traffic must be flow controlled at the source, to avoid congestion the ATM network. In this paper, we present a feedback control algorithm for ABR traffic which source rates are adjusted according to virtual circuit queue levels at intermediate nodes along the path. We propose a simple and classical proportional controller, plus a Smith predictor to overcome instabilities due to large propagation delays. This scheme outperforms the proportional rate control algorithm.

Multipoint-to-multipoint ABR service in ATM

Data traffic in modern telecommunications systems is loss-sensitive, delay-insensitive, and highly bursty. Most data applications cannot predict their own traffic parameters, but require low cell loss rates. These features make traffic management for data traffic complex. In ATM networks, where multiple types of applications co-exist, it becomes even more difficult. Many models have been proposed for the flow control of data traffic over ATM networks. Among them the explicit rate (ER) mechanism proposed for the available bit rate (ABR) service is the principal method. The ER and other proposed mechanisms are found to suffer in some regard. These mechanisms also need many buffers in the intermediate switches and thus increase the hardware costs. Flow control based on bandwidth contracting (BCA), can achieve higher bandwidth throughputs at lower hardware costs. In this paper, we evaluate ER and BCA mechanisms in LAN and WAN environments for bursty data traffic. This study focuses on the use of short-term bandwidth contracts for the reliable transport of bursty data.

The key issue at a branch-point switch for point-to-multipoint (multicast) available bit rate (ABR) flow control is how to consolidate backward resource management (BRM) cells returning from each branch to avoid feedback implosion. However, consolidating BRM cells at a branch point can cause undesirable effects such as consolidation noise, consolidation delay, and consolidation loss. This paper first investigates the consolidation problems and proposes their solutions. Furthermore, it introduces various implementation alternatives for the proposed solutions. A combination of the proposed solutions, in which each branch point stores feedback information on a per-branch basis for each multicast virtual connection and only passes BRM cells returning from the farthest destination, provides a good fairness, a higher efficiency and an excellent scalability. In addition, if a fast overload indication is additionally employed, the feedback delay can be significantly reduced in an overload situation.

We investigate the performance of the EFCI-based (explicit forward congestion indication) and ER-based (explicit rate; EPRCA in particular) algorithms for the rate-based flow control of the ABR (available bit rate) traffic in an ATM network. We consider the case of multiple switches in tandem. We present several definitions of a bottleneck, and provide conditions that determine which queue is the bottleneck. We show that it is not necessarily the queue with the slowest transmission rate that is the first to notify congestion, and that queues with faster transmission rates can increase considerably the congestion. Moreover, a queue may build up in a faster node before it builds in a slower one. We derive analytic formulas for the maximum queue length. We compare our results to those obtained by approximating a network by a simpler one, containing only the bottleneck switch. We show that the maximum queue lengths under the approximating approach may largely underestimate the ones obtained in the real network.