ABR和UBR业务模型的TCP接入分析

ＡＢＲ和ＵＢＲ业务是ＡＴＭ中新定义的业务类型，主要面向数据传输服务。ＴＣＰ是目前最为流行的数据输协议，采用基于窗口的拥塞控制机制。本文主要讨论了ＴＣＰ接入ＡＢＲ和ＵＢＲ业务时所呈观的一些特点及ＡＴＭ交换机缓存的大小对ＴＣＰ性能的影响。     

ATM网络中ABR业务的流量控制

本文讨论了ＡＴＭ网络中ＡＢＲ业务的特性及基于ＡＢＲ业务的拥塞控制机制，了拥塞控制技术的最新发展情况，并比较了各种控制机制的优缺点。     

ATM宽带网络流量与拥塞控制研究

文章阐明对ＡＴＭ网络进行流量与拥塞控制不仅是由ＡＴＭ网络的分组交换本质所决定，也是实现Ｂ－ＩＳＤＮ的基本要求，文章还对目前ＡＴＭ网络的ＡＢＲ流量与拥塞控制机制进行了评述，提出了ＡＢＲ流量控制尚待解决的一些问题。     

ABR业务流量控制中的是速率反馈

ＡＢＲ（Ａｖａｉｌａｂｌｅ Ｂｉｔ Ｒａｔｅ）业务可以提高ＡＴＭ网络的利用率，能让用户ＬＡＮ通过广域网进行高吞吐量、低丢失率的互通。可以预计，未来ＡＴＭ网上的数据业务将主要用ＡＢＲ连接来传输。ＡＢＲ业务中的首要问题是流量控制。文章在比较了几种流量控制方案后，认为显速率反馈是ＡＢＲ业务流及拥塞控制的一个有效方法，是完善ＡＢＲ业务的一个重要手段，并对显速率算法作了进一步研究。     

ATM网络中基于ABR业务的闭环拥塞控制

论文讨论了ＡＴＭ网络中ＡＢＲ业务的特性及基地ＡＢＲ业务的拥塞控制机制，了拥塞控制技术的最新发展情况，并比较了各种控制机制的优缺点。     

VBR背景业务下的ABR拥塞特性

ＡＢＲ业务的拥塞控制方案是当前ＡＴＭ研究方面的热点,本文首先分析了存在ＶＢＲ背景业务时,ＡＢＲ拥塞控制方案的动态特性,然后将此分析模型用于研究明确速率反馈交换机的排队性能,并研究了ＴＣＰｏｖｅｒＡＢＲ的拥塞特性。     

可用比特率业务及其拥塞控制机制

通过ＡＢＲ业务同ＣＢＲ、ＶＢＲ和ＵＢＲ业务比较，描述了它的本质特性，然后分析讨论目前适用于ＡＢＲ业务的几种基于速率控制，闭环反馈形式的拥塞控制机制。     

ABR业务特性及业务量管理方法

由ＡＴＭ Ｆｏｒｕｍ提出的ＡＢＲ业务近来颇受各方关注，本文给出了ＡＢＲ业务的背景，ＡＢＲ业务的特点及其流量控制方法，并对在实现ＡＢＲ业务过程中可能碰到的问题进行了讨论。     

基于ATM的无源光网络媒质接入控制协议的设计

针对基于ＡＴＭ的无源光网络（ＡＴＭ－ＰＯＮ）设计了一种媒质接入控制（ＭＡＣ）协议。该协议的设计遵照ＩＴＵ－Ｔ有关ＡＴＭ－ＰＯＮ的建议Ｇ．９８３．１（１９９８年１０月）中所定义的帧结构。该协议能够支持ＣＢＲ／ＶＢＲ、ＡＢＲ和ＵＢＲ等多种业务,并能够保证用户公平地接入和充分地利用网络的资源。其中ＣＢＲ／ＶＢＲ业务的优先级最高,同时也确保ＡＢＲ业务至少能以最小信元通信。系统的剩余带宽资源被分配给ＵＢＲ业     

ATM网络中ABR业务的监控方案

基于离散事件动态系统理论,提出了一种崭新的用于控制ＡＴＭ网络中ＡＢＲ业务流量的监控方案,这种方案具有简单易于实现的特点,仿真结果与理论预测值的一致证明了该方案的正确性。     

ATM网中ABR业务及其反馈流量控制

ABR（AvailableBitRate）业务是近年来为了充分利用ATM网络的剩余带宽而提出的一种新型业务类型，自从1993年被ATM论坛正式提出以来得到了很快的发展。文章对该业务的特点和发展过程作了较全面的介绍，对该类型业务的流量控制方法作了比较深入的分析和研究，对流量控制中关键因素的改进提出了自己的见解。     

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.     

Evaluation of congestion control protocols for ABR traffic over ATM networks

Congestion control is very important for effective and stable operation of ATM (Asynchronous Transfer Mode) networks. Owing to the bursty and unpredictable characteristic of data network traffic, its congestion control is particularly a challenge for network researchers and designers. The ATM Forum has recently adopted rate‐based congestion control for ABR (Available Bit‐Rate) traffic which is the service class defined for data network applications. However, there is a number of congestion control schemes prevalent. ATM Forum has decided not to specify switch behaviour for ABR traffic; this has further introduced additional ambiguity. Consequently, an evaluation and comparison of the existing protocols would provide valuable guidance for network designers and engineers; it would also give insight for researchers to explore the essence of different congestion control schemes. In the first part of this paper, we investigate the effectiveness of ABR congestion control in the presence of bursty source traffic and the relationship between the burst time scale and the ABR control time scale. Two ABR congestion control schemes, the ABR Explicit Forward Congestion Indication (EFCI) and ABR Congestion Indication (CI) schemes, are compared with Unspecified Bit Rate (UBR) transport which makes no effort to control congestion. Traffic sources of various burst lengths of 100, 1000, 10000, and an equal mix of 100 and 10000 ATM cells are used in simulations. It is found that ABR congestion control schemes effectively control low frequency, medium to long‐term traffic load transients. This is further supported by the result of integrating TCP over ATM congestion control schemes included in the paper. ABR control schemes do not control high frequency, short‐term load transients well, but ABR control is not necessary in such cases since short‐term transients do not require a large amount of buffering. In the second part of this paper, we evaluate and compare six rate‐based congestion control protocols including Scheme I: EFCI, Scheme II: EFCI with separate RM queues, Scheme III: CI, Scheme IV: CI with separate RM queues, Scheme V: the CAPC2 ER (Explicit Rate), and Scheme VI: the EFCI with utilization‐based congestion indication. Each scheme is simulated and compared in the LAN, WAN, and GFC (General Fairness Configuration) environments specified by the ATM Forum. Effects of varying VC (Virtual Circuits) number and changing endsystem–switch distance has been investigated. Their fairness is also compared using the GFC configuration. We have found that ER control scheme performs significantly better than the other five binary control schemes by its faster response to congestion, smoother regulation of bit‐rates, lower queueing delay, shorter buffer queue length, and fairness. Among the other five schemes, the CI scheme performs better than the EFCI scheme. Providing separate RM queues has significantly improved the EFCI scheme in the WAN environment, but has little effect on the CI scheme. Link utilization‐based congestion detection has suffered from either low utilization or an excess cell loss which is unacceptable in most data applications. Copyright © 2000 John Wiley & Sons, Ltd.     

一种改进的ABR流量控制算法

为提高ATM网络流量管理性能,在随动控制结构上,进一步考虑时延因素的影响,提出了一种基于离散模型的改进的ABR流量控制算法。给出了保证时滞系统闭环稳定的参数选择方法,实现了拥塞避免和可用带宽的动态公平分配,保证了服务质量。仿真结果进一步验证了理论的正确性和可行性。     

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.     

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

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

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.     

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.     

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

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

网络流量控制系统的设计--Kalman算法

在ATM网络的ABR通信中,基于速率反馈的流量控制是防止拥塞和保证高吞吐量的主要手段之一,然而网络的传播时延对其具有很大的不利影响。本文根据网络控制的特点,采用Kalman控制算法对流量控制器进行设计,较好地克服了传播时延所带来的不利影响。理论分析表明该算法保证了网络缓冲器的不溢出及带宽的公平分配和充分利用,动态性能明显优于PID控制器,并得到了仿真结果的验证。