Parameter tuning of rate-based congestion control algorithm for ABR service class in ATM networks

A rate-based congestion control algorithm has been developed and standardized in the ATM forum for ABR service class. In the standard the behaviour of source and destination end systems is specified by several control parameters such as RIF (rate increase factor) and RDF (rate decrease factor). In spite of the fact that the performance of the rate-based congestion control algorithm depends heavily on the selection of these control parameters, no selection method of parameters is shown in the standard. In this paper, by extending our previous work, appropriate settings of rate-control parameters in the various circumstances are investigated. We first analyse the dynamical behaviour of the rate-based congestion control for multiple groups of ABR connections with different propagation delays. Next we evaluate the effect of CBR traffic on ABR connections. Simulation results for a multihop network configuration are also presented to exhibit the trade-off relationship among cell loss probability, link utilization and fairness. Finally, a selection method of control parameters in the multihop network is proposed based on our analytic methods and simulation results © 1998 John Wiley & Sons, Ltd.     

The DDTCI switch algorithm for ABR traffic control in ATM networks

For the issue of flow control for Available Bit Rate (ABR) traffic in ATM network,a new improved Explicit Rate (ER) algorithm named Dynamic Double Threshold Congestion Indication (DDTCI) algorithm is presented based on the Explicit Forward Congestion Indication (EFCI) Current Cell Rate (CCR) algorithm and Relative Rate (RR) algorithm. Different from the early ER algorithm, both the high-level and the low-level threshold is dynamically changing according to the state of the bottleneck node. We determinate the congestion state with the information of the two dynamic threshold, and control the cell rate of the source by feed back mechanism. Except for the well performance in both link utilization and fairness in distribution of available bandwidth, the improved algorithm can alleviate the fluctuation of sending rate dramatically. The mechanism is modeled by a fluid model, and the useful expressions are derived.Simulation results show up our conclusion.     

Performance analysis and interoperability issue of consolidation algorithms in point‐to‐multipoint ABR services

In this paper we propose a performance analysis of the consolidation algorithms in point‐to‐multipoint ABR services in ATM network. We also present a new efficient consolidation algorithm, which overcomes some drawbacks of the previous works. The performance of the previous works and our proposed consolidation algorithms are analysed mathematically. General equations for calculating the response time and allowed cell rate of the source are derived. The derived equations show relatively good agreement with simulation results and can be applied for using in various network topologies. In addition, the interoperability issue in multicast available bit rate (ABR) is investigated. It is found that the branch points implemented with different consolidation algorithms can work interoperably. It is concluded from the simulation results that the performance of the point‐to‐multipoint ABR services is dominated by the most upper stream branch point (the nearest one to the source), therefore, in order to avoid the consolidation noise and get a faster response in the network, the most upper stream branch point has to be implemented with a high accuracy consolidation algorithm while the lower stream branch point(s) should be implemented with a fast response consolidation algorithm with a less degree of complexity. Copyright © 2002 John Wiley & Sons, Ltd.     

Performance analysis of congestion avoidance algorithms with non‐zero MCR guarantee for ABR service in ATM networks

This paper proposes a novel explicit rate allocation algorithm called Fast Rate Allocation Congestion Avoidance (FRACA) algorithm supporting non‐zero minimum cell rate (MCR). The non‐zero MCR guarantee strategy for ABR service in ATM networks focused in this paper is MCR plus equal share (The ATM Forum Traffic Management Specification, version 4.0. April 1996). The main goals for designing the algorithm are the fast convergence according to the max–min fairness criteria, fairness among all sessions, maximum network utilization while the switch queue length is properly controlled. At the same time, it should work well under a wide range of network conditions without the need for adjusting the algorithm parameters. The performance of the proposed algorithm is evaluated and compared with the Generic Weighted Fairness (GWF) ERICA + (J Comput Comm 2000; 149). Simulation results show that the proposed algorithm achieves the design goals in the evaluated scenarios. Copyright © 2004 John Wiley & Sons, Ltd.     

Design and evaluation of an efficient traffic control scheme for integrated voice,video, and data over asynchronous transfer mode networks: Explicit allowed rate algorithm

Asychronous transfer mode (ATM) networks are high‐speed networks with guaranteed quality of service. The main cause of congestion in ATM networks is over utilization of physical bandwidth. Unlike constant bit‐rate (CBR) traffic, the bandwidth reserved by variable bit‐rate (VBR) traffic is not fully utilized at all instances. Hence, this unused bandwidth is allocated to available bit‐rate (ABR) traffic. As the bandwidth used by VBR traffic changes, available bandwidth for ABR traffic varies; i.e., available bandwidth for ABR traffic is inversely proportional to the bandwidth used by the VBR traffic. Based on this fact, a rate‐based congestion control algorithm, Explicit Allowed Rate Algorithm (EARA), is presented in this paper. EARA is compared with Proportional Rate Control Algorithm (PRCA) and Explicit Rate Indication Congestion Avoidance Algorithm (ERICA), in both LAN and WAN environments. Simulations of all three algorithms are conducted under both congestion and fairness configurations with simultaneous generation of CBR, rt‐VBR, nrt‐VBR and ABR traffic. The results show that, with very small over‐head on the switch, EARA significantly decreases the required buffer space and improves the network throughput. Copyright © 1999 John Wiley & Sons, Ltd.     

The dual flow control problem of TCP over ATM ABR services

In this paper, we investigate the dual control problem—TCP flow control at the TCP layer and ABR flow control at the ATM layer. First, we observe that TCP flow control and ABR flow control cannot co‐operate well. The worst case is that the slow start after packet loss causes high but unused ACR (Allowed Cell Rate) which raises the potential of cell loss and an underflowed switch queue which reduces ABR throughput. We suggest to implement a use‐it‐or‐lose‐it policy for ABR and fast recovery for TCP to avoid these phenomena. Copyright © 1999 John Wiley & Sons, Ltd.     

The distributed robust traffic controller for ATM networks

We propose an approach to design a distributed rate‐based traffic controller to flow‐regulate the best‐effort service (e.g. ABR) traffic and guaranteed service traffic through an ATM switch. The controller is distributed among the source nodes and has a very simple structure. Its local controller at each source node is open‐loop stable and only requires the knowledge of the buffer occupancy at the bottleneck switch. We show that this controller is fair and is not sensitive to the change of VCs over time. It does not have oscillation and can achieve a high utilization. Copyright © 2001 John Wiley & Sons, Ltd.     

基于市场拍卖模型的ATM网络ABR业务控制

本文提出一种分布式的、基于用户竞价模型的ＡＴＭ网络ＡＢＲ业务控制机制,可为用户提供在业务传输中没价格与不同服务质量等级之间的协商。在此欺压耻我们定义了新的资源利用公平性准则。它是最大一最小准则的扩充,本文方法所用的控制和计旨易于实现,并且遵循ＡＴＭ论坛提出的ＡＢＲ业务明确位率反馈控制规范,因而此方法ＡＢＲ业务的计旨几分布式管理相集成提供了一条新思路。     

ATM网络中ABR业务的开环控制机制

ＡＴＭ网络中ＡＢＲ业务的流量控制是ＡＴＭ论坛的流量管理规范（ＴＭ４．０）中没有完全解决的问题,ＡＢＲ基于速率的闭环控制方案在最大－最小准则下获得了一定进展。但在拥塞发生在信源外或对突发性业务进行控制的情况下,添加开环控制的ＡＢＲ拥塞控制可以获得比闭环控制更佳的作用。研究了ＡＢＲ的开环控制方案,早期的ＵＩＬＩ机制本身存在在一定的问题,在交换机处采用基于计数的ＵＩＬＩ机制能够取得较好的效果。     

Intelligent Flow Control Technique of ABR Service in ATM Networks Based on Fuzzy Neural Networks

ＩｎｔｅｌｉｇｅｎｔＦｌｏｗＣｏｎｔｒｏｌＴｅｃｈｎｉｑｕｅｏｆＡＢＲＳｅｒｖｉｃｅｉｎＡＴＭＮｅｔｗｏｒｋｓＢａｓｅｄｏｎＦｕｚｚｙＮｅｕｒａｌＮｅｔｗｏｒｋｓ①ＺｈａｎｇＬｉａｎｇｊｉｅＬｉＹａｎｄａＬｉＱｉｎｇｈｕａＷａｎｇＰｕ（ＤｅｐｔｏｆＡ...     

ATM网络基于EFCI机制的拥塞控制的缓存性能

本文根据文献「１」中给出的ＡＴＭ网络拥塞控制模型,对一类简单控制方案的缓存性能了深入的分析,得到了更为精确的缓存空间和阈值,同时讨论了多种业务在网络中共存的情况,并根据ＥＦＣＩ的拥塞检测机制,提出了一种新的控制策略。仿真结果表明了分析的正确性。     

Application of a new explicit‐rate ABR traffic controller

In broadband integrated communication systems, the classical method of max–min fair‐rate allocation for traffic control does not support the weighted‐rate guarantee. The weighted‐rate guarantee is necessary for available‐bit rate (ABR) service models. This fact motivates that the weighted max–min (WMM) fair‐rate allocation for the ABR traffic is widely studied. However, the combination of close‐loop feedback control with WMM algorithm has not appeared in the previous research. In this paper, a practical WMM fair‐rate allocation model is proposed. This scheduling scheme combines and integrates the congestion avoidance using proportional control (CAPC) and the weighted max–min fair‐rate allocation. This model is designed to achieve higher utilization and also bounded delay for ABR traffic flow control. In the system under analysis, the performance of this new weighted traffic scheduler is evaluated. The system presented in this paper is also compared with WMM and CAPC methods. Copyright © 2001 John Wiley & Sons, Ltd.     

Adaptive ABR congestion control with active buffer control

ATM Forum has defined that the ABR service is designed mainly for data traffic. The design of a simple and efficient congestion control scheme is a problem that network managers have to face. In this paper, we propose a control scheme for ABR service for better scalability and response. The scheme uses both the load level and an increase in queue length to detect the presence of congestion. Continuous control functions are designed for the bandwidth allocation. A better buffer control is achieved by incorporating the percentage of buffer occupancy into the control function. All of the control functions are designed in such a way that they are sensitive to the change of the system states when they are far from the optimal level to get a fast response, but insensitive and change slowly when the states are close to the optimal level to keep the system around the steady state. Our simulation results show that the algorithm is fair to all the connections and it converges fast when the network's condition changes. Copyright © 2001 John Wiley & Sons, Ltd.     

TCP over ATM的拥塞控制研究进展

指出了ＴＣＰ／ＩＰ在ＡＴＭ网络中运用遇到的困难,综述了ＴＣＰ拥塞控制方案与ＡＴＭ层拥塞控制策略的进展,概述了ＴＣＰｏｖｅｒＡＴＭ研究的现状,指出了为的工作方向。     

Resource Requirements for ABR Explicit Rate Flow Control: Deterministic and Probabilistic Analyses

ATM Available Bit Rate (ABR) service is intended to offer low cell loss for non-real-time data sources that can respond to closed-loop flow control. ATM Forum Traffic Management Specification Version 4.0 defines the various parameters used in the ABR flow control, as well as the source, destination, and switch behaviors. However, the switch designers and service providers are free to choose the method of congestion control to implement and the ABR Quality of Service (QoS) objective to offer. This paper addresses the interaction among the flow control algorithm, the switch resource requirements, and the resulting QoS characteristics.In this paper we propose and evaluate an Explicit Rate (ER) algorithm. The objective of this algorithm is to maintain the total buffer occupancy of all ABR connections to be close to a given threshold. By maintaining a non-zero queue, the ABR service can achieve a high utilization. The switch periodically determines its desirable ER value, based on the available capacity, the ABR buffer occupancy, and the number of active ABR sources.We develop analyses that relate ABR resources to QoS objectives for this algorithm. The first approach is a deterministic, conservative analysis. It provides formulas for determining the ABR buffer and capacity requirements that can achieve zero buffer overflow.The second analysis determines an upper bound on the buffer overflow probability when the above requirements are not met. The result is most effective when the number of active sources is a small fraction of the total ABR connections. Numerical examples show that by slightly relaxing the loss constraint, resource requirements can be significantly reduced.     

ATM技术在大型企业网络中的实践和应用

本文阐述异步传递模式通信技术 (ATM )在我国某大型企业网络中的实际应用 ,并探讨我国大型企业网络的技术发展途径。     

ABR业务流量控制的一种智能机制

本文提出了一种ＡＢＲ业务模糊流量控制机制,仿真结果表明它有效地避免了网络阻塞,在网络的吞吐量上要高于强比例速率控制算法（ＥＰＲＣＡ）。该机制与连接业务的特性无关,且不需要改变有关ＡＢＲ闭环反馈的流量控制结构,这为算法的实际应用提供了前提。     

一种新的用于ATM网中ABR点对多点连接的反馈合并算法

本文提出了一种新的用于ＡＴＭ网中的ＡＢＲ点对多点连接的反馈合并算法。新算法不仅能同时解决“合并噪声”和“合并延迟”问题,而且由于提供一种根据反向资源管理信元的ＣＩ域判断支路拥塞程度的机制,因此即使在ＥＲ交换机与二进制交换机并存的网络环境中仍然性能优越,这是现有算法所无法做到的。我们的仿真结果清楚地表明了这一点。