Cooperative congestion control schemes in ATM networks

One of the basic problems faced in the design of efficient traffic and congestion control schemes is related to the wide variety of services with different traffic characteristics and quality of service (QoS) requirements supported by ATM networks. The authors propose a new way of organizing the control system so that complexity is easier to manage. The multi-agent system approach, which provides the use of adaptative and intelligent agents, is investigated. The authors show, through the two congestion control schemes proposed, how to take advantage of using intelligent agents to increase the efficiency of the control scheme. First, TRAC (threshold based algorithm for control) is proposed, which is based on the use of fixed thresholds which enables the anticipation of congestion. This mechanism is compared with the push-out algorithm and it is shown that the authors' proposal improves the network performance. Also discussed is the necessity of taking into account the network dynamics. In TRAC, adaptative agents with learning capabilities are used to tune the values of the thresholds according to the status of the system. However, in this scheme, when congestion occurs, the actions we perform are independent of the nature of the traffic. Subsequently, we propose PATRAC (predictive agents in a threshold based algorithm for control) in which different actions are achieved according to the QoS requirements and to the prediction of traffic made by the agents. Specifically, re-routing is performed when congestion is heavy or is expected to be heavy and the traffic is cell loss sensitive. This re-routing has to deflect the traffic away from the congestion point. In this scheme, we propose a cooperative and predictive control scheme provided by a multi-agent system that is built in to each node     

Analysis of adaptive routing schemes in multirate loss networks

As technology evolves, it is now feasible to implement sophisticated adaptive routing schemes on networks which support different kinds of services with heterogeneous bandwidth characteristics. Adaptive routing can increase the network throughput by routing calls to less congested paths. It can also be used to bypass transmission facility failures. In this paper, we analyze and compare two adaptive routing schemes. The first is called theMaximum mean time to blocking (MTB) routing which is based on themean time to blocking measure of a link. This measure captures the traffic rates, bandwidth characteristic and link capacity information and reflects more accurately the congestion status of different paths. The second is theM ² routing, which is a modification of the least loaded routing (LLR). Aggregation of link status information can significantly reduce signalling traffic. We show in this paper that with properly designed aggregation, the aggregatedM ² and MTB routings can have performance that approach that of the non-aggregated schemes. The use of complete sharing and restricted access policies together with trunk reservation control in multirate loss networks are also studied.     

IP over WDM网中的策略路由算法

业务量工程允许管理者通过赋予业务主干不同的业务量工程属性来体现一定的管理策略,在为业务主干建立标记交换路径(LSP)时也应该考虑这些策略的影响,该文讨论了业务主干具有不同优先权属性时的 LSP建立问题,针对中断 LSP个数最少和中断业务量最小两种指标,分别提出不同的解决策略:最小连接数中断法(MCNIM)和最小连接带宽中断法(MCBIM),并在不同负载的动态业务下对所提算法进行了仿真研究,给出了仿真结果。     

Potential Interactions between IP-dial and Voice Traffic on the PSTN

This paper considers possible interactions that arise when IP-dial (i.e. Internet access via the PSTN) and voice traffic share the same infrastructure. The concern is caused by the different properties of the two traffic streams, with IP-dial being associated with long call hold times and automatic redialling. In order to gain an understanding, a simple single-link system is extensively studied using simulation. The results show that automatic redialling causes the IP-dial traffic stream to be much more efficient at seizing circuits than the voice traffic when the system is overloaded, and therefore congested. The use of various controls to establish a more equitable distribution of circuit resource between the two traffic streams in the event of congestion is considered and trunk reservation selected as the preferred control. Additional simulations establish appropriate trunk reservation settings and establish its efficacy. The paper concludes that network operators should consider carefully the effect of mixing IP-dial and voice traffic on shared infrastructure, and that trunk reservation is the preferred technique for controlling unwanted interactions.     

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.     

对交通信号灯模糊控制的自主创新性设计

针对日益严重的交通拥堵问题设计出一种新型两级模糊控制方案来对四相位三车道单交叉口的交通信号灯进行实时智能控制。该新方案沿用了当前各种交通信号灯控制方案的优点,同时针对其不足之处进行了弥补与完善,是一种同时具有自适应控制、分级模糊控制、相位繁忙优先和准确显时等优势的控制方案,更适用于实际的交通情况。对新型模糊控制方案进行了仿真研究,仿真结果表明该方案明显优于传统控制方案。最后还对该新方案进行了动态模拟演示,使其更具可观性和真实性,更易于运用到交通现场。     

Comparison of admission control schemes in ATM networks

Asynchronous transfer mode (ATM) offers an efficient means of carrying a wide spectrum of BISDN traffic provided that network congestion is prevented. Unfortunately, efficient congestion control is difficult to achieve in integrated broadband networks, owing to the wide range of traffic characteristics and quality of service (QOS) requirements. We have implemented a network simulator that allows us to evaluate many proposed admission control schemes using many different traffic models. We present the results of several simulation studies, including one study of the performance of the admission control schemes in the presence of traffic sources that exhibit long-term dependence.     

Adaptive congestion control for DSRC vehicle networks

Dedicated short range communications (DSRC) was proposed for collaborative safety applications (CSA) in vehicle communications. In this article we propose two adaptive congestion control schemes for DSRC-based CSA. A cross-layer design approach is used with congestion detection at the MAC layer and traffic rate control at the application layer. Simulation results show the effectiveness of the proposed rate control scheme for adapting to dynamic traffic loads.     

Resource allocation for broadband networks

The major benefit of a broadband integrated ATM (asynchronous transfer mode) network is flexible and efficient allocation of communications bandwidth for communications services. However, methods are needed for evaluating congestion for integrated traffic. The author suggests evaluating congestion at different levels, namely the packet level, the burst level, and the call level. Congestion is measured by the probabilities of packet blocking, burst blocking, and call blocking. He outlines the methodologies for comparing these blocking probabilities. The author uses the congestion measures for a multilayer bandwidth-allocation algorithm, emulating some function of virtual circuit setup, fast circuit switching, and fast packet switching at these levels. The analysis also sheds insight on traffic engineering issues such as appropriate link load, traffic integration, trunk group and switch sizing, and bandwidth reservation criteria for two bursty services     

一种多播拥塞控制中速率的调节机制

本文针对计算机高速互联网中多播流的速率调节问题,在单点对多点的多播流量模型基础上,提出了一种由发送方驱动的单速率多播拥塞控制器的设计方法。并且运用现代控制理论和方法,讨论如何利用基于多播的单速率拥塞控制方法来对多播发送节点的发送速率进行调节,从而使得发送节点的发送速率趋于稳定。对所提出的拥塞控制方案,本文进行了分类仿真,仿真结果显示,控制方案使网络性能表现良好。     

PERFORMANCE ANALYSIS FOR ATM SWITCHING OF MIXED CONTINUOUS-BIT-RATE AND BURSTY TRAFFIC WITH SMOOTHING FUNCTION

Traditional packet switching networks have typically employed window-based congestion control schemes in order to regulate traffic flow. In ATM networks, the high speed of the communication links and the varied nature of the carried traffic make such schemes inappropriate. Therefore, simpler and more efficient schemes have to be proposed to improve the congestion control for ATM switching. This paper presents an exact performance analysis of ATM switching whose inputs consist of Continuous-Bit-Rate(CBR) and bursty traffic. The CBR traffic and bursty traffic are described by Bernoulli process and the Interrupted Bernoulli Process(IBP), respectively. Bursty traffic smoothing mechanism is analyzed. With the use of a recursive algorithm, the cell loss probability and the average delay for ATM switching of mixed CBR and bursty traffic are exactly calculated. Traffic smoothing could be implemented at a slower peak rate keeping the average rate constant or decreasing the average bursty length. Both numerical a     

A geographic routing protocol based on trunk line in VANETs

A Trunk Line Based Geographic Routing(TLBGR) protocol in Vehicular Ad-hoc Networks (VANETs) is proposed in this paper to solve the problem of data acquisition in the traditional trunk coordinated control system. Because of the characteristics of short communication time and high packet loss among vehicles, the vehicles entering the trunk lines can not transmit their information to the trunk coordinated control system stably. To resolve this problem, the proposed protocol uses the trunk lines’ traffic flow and the surrounding road network to provide a real-time data transmission routing scheme. It takes into account the data congestion problem caused by the large traffic flow of the main roads, which leads to the corresponding increase of the information flow of the section and the package loss, and the link partition problem caused by the insufficient traffic flow, which makes the vehicles have to carry and relay information thus increasing the transmission delay. The proposed TLBGR protocol can be divided into two stages: the next-intersection selection, and the next-hop selection in the chosen path between the current and next intersections. Simulation results show that, compared with other IoT routing protocols including Greedy Perimeter Stateless Routing (GPSR), Ad-hoc On Demand Vector (AODV), and Q-AODV, the TLBGR protocol has better performance in aspects of end-to-end delay, delivery rate, and routing cost under the scenario of urban traffic trunk lines. The TLBGR protocol can effectively avoid data congestion and local optimum problems, increase the delivery rate of data packets, and is therefore suitable for the routing requirements in this application scenario.     

Topology design and bandwidth allocation in ATM nets

The design of a P/S network embedded into a backbone facility network is discussed. The problem is formulated as a network optimization problem where a congestion measure based on the average packet delay is minimized, subject to capacity constraints posed by the underlying facility trunks. The variables in this problem are the routing on the express pipes (i.e. the channels that interconnect the P/S modes) and the allocation of bandwidth to such pipes. An efficient algorithm is presented for the solution of the above problem and it is applied to some representative examples. It is shown that for some test cases the congestion measure is substantially reduced with respect to the values obtained when the embedded topology is kept identical to the backbone topology. Dynamic reconfiguration schemes where the embedded topology is periodically adjusted to track the fluctuations in traffic requirements are discussed     

Congestion Control in Store and Forward Tandem Links

This paper discusses the problem of congestion in message-switched data communication networks. This condition occurs when more traffic enters a network than can reasonably be served. Two types of techniques employed to control congestion in already existing national networks are identified. A queueing model which can be used to analyze and compare these control schemes for a simple tandem link network is developed. Finally, analytic results are presented which describe the behavior of the simple network using the two control schemes, and which should be useful in the design of more general networks as well.     

Interactions Between Routing and Flow Control Algorithms

In this paper we discuss the interactions between routing and flow control algorithms for packet-switched networks. We present a new variation on the Gallager-Golestaani flow control scheme [4] and also a new variable window scheme. The tradeoff between throughput and network congestion is examined. It is shown that these two flow control schemes have the unique feature that the parameters can be specified to place an upper bound on the expected amount of network congestion.     

Achieving inter-session fairness for layered video multicast

The Internet is increasingly used to deliver multimedia services. Since there are heterogeneous receivers and changing network conditions, it has been proposed to use adaptive rate control techniques such as layered video multicast to adjust the video traffic according to the available Internet resources. A problem of layered video multicast is that it is unable to provide fair bandwidth sharing between competing video sessions. We propose two schemes, layered video multicast with congestion sensitivity and adaptive join-timer (LVMCA) and layered video multicast with priority dropping (LVMPD), to achieve inter-session fairness for layered video multicast. Receiver-driven layered multicast (RLM), layer-based congestion sensitivity, LVMCA, and LVMPD are simulated and compared. Results show both proposed schemes, especially LVMPD, are fairer and have shorter convergence time than the other two schemes.     

Congestion control schemes for reverse link data transmission in multimedia CDMA systems

We investigate the congestion control schemes for reverse link in code division multiple access multimedia systems. We propose four schemes according to the control bit setting methods at base and the rate decision schemes in mobiles. With the proposed schemes, all mobiles control their transmission power and rate simultaneously. As the aggregate effect, the cell-wide congestion control is accomplished. The performance of systems with the proposed schemes are evaluated using computer simulation and compared with each other. Under a congested situation, the proposed schemes guarantee the priority of real-time traffic over non-real-time traffic and prevent an excessively high error rate for real-time services. We describe and evaluate the proposed schemes under the system model assumption based on 1xEV-DO and cdma2000. However, the proposed schemes can be also applied to wide-band code division multiple access systems with minor modification.     

Adaptive Congestion Control of mSCTP for Vertical Handover Based on Bandwidth Estimation in Heterogeneous Wireless Networks

This paper proposes a new congestion control scheme of mobile Stream Control Transmission Protocol (mSCTP) for vertical handover across heterogeneous wireless/mobile networks. The proposed scheme is based on the estimation of available bandwidths in the underlying network as a cross-layer optimization approach. For congestion control of mSCTP, the initial congestion window size of the new primary path is adaptively configured, depending on the available bandwidth of the new link that a mobile node moves into. By ns-2 simulation, the proposed scheme is compared with the existing congestion control schemes in the throughput perspective. From the numerical results, we can see that the proposed mSCTP congestion control scheme could give better performance than the existing schemes in the wireless networks with an amount of background traffic.     

Infrastructure‐based vehicular congestion detection scheme for V2I

With the increasing number of vehicles, traffic jam becomes one of the major problems of the fast‐growing world. Intelligent transportation system (ITS) communicates perilous warnings and information on forthcoming traffic jams to all vehicles within its coverage region. Real‐time traffic information is the prerequisite for ITS applications development. In this paper, on the basis of the vehicle‐to‐infrastructure (V2I) communication, a novel infrastructure‐based vehicular congestion detection (IVCD) scheme is proposed to support vehicular congestion detection and speed estimation. The proposed IVCD derives the safety time (time headway) between vehicles by using iterative content‐oriented communication (COC) contents. Meanwhile, the roadside sensor (RSS) provides an infrastructure framework to integrate macroscopic traffic properties into the estimation of both the traffic congestion and vehicle safety speed. The main responsibilities of RSS in IVCD are to preserve privacy, aggregate data, store information, broadcast routing table, estimate safety speed, detect traffic jam, and generate session ID (S‐ID) for vehicles. Monte Carlo simulations in four typical Chinese highway settings are presented to show the advantage of the proposed IVCD scheme over the existing Greenshield's and Greenberg's macroscopic congestion detection schemes in terms of the realized congestion detection performance. Real road traces generated by Simulation of Urban Mobility (SUMO) over NS‐3.29 are utilized to demonstrate that the proposed IVCD scheme is capable of effectively controlling congestion in both single and multilane roads in terms of density and speed health with previous schemes in this field.