Advances in Active Queue Management (AQM) Based TCP Congestion Control

Current end-to-end Internet congestion control under tail-drop (TD) queue management experiences performance degradations such as multiple packet losses, high queueing delay and low link utilization. In this paper, we review recently proposed active queue management (AQM) algorithms for supporting end-to-end transmission control protocol (TCP) congestion control. We focus recently developed control theoretic design and analysis method for the AQM based TCP congestion control dynamics. In this context, we analyze the problems of existing AQM proposals in which congestion is detected and controlled reactively based on current and/or past congestion. Then we argue that AQM based TCP congestion control should be adaptive to the dynamically changing traffic situation in order to detect, control and avoid the current and the incipient congestion proactively. Finally, we survey two adaptive and proactive AQM algorithms, PID-controller and Pro-Active Queue Management (PAQM), designed using classical proportional-integral–derivative (PID) feedback control to overcome the reactive congestion control dynamics of existing AQM algorithms. A comparative study of these AQM algorithms with existing AQM algorithms is given. A simulation study under a wide range of realistic traffic conditions suggests that PID-controller and PAQM outperform other AQM algorithms such as random early detection (RED) [Floyd and Jacobson, 18] and proportional-integral (PI) controller [Hollot et al., 24].     

A fuzzy-logic control algorithm for active Queue Management in IP networks

Active Queue Management （AQM） is an active research area in the Internet community. Random Early Detection （RED） is a typical AQM algorithm, but it is known that it is difficult to configure its parameters and its average queue length is closely related to the load level. This paper proposes an effective fuzzy congestion control algorithm based on fuzzy logic which uses the predominance of fuzzy logic to deal with uncertain events. The main advantage of this new congestion control algorithm is that it discards the packet dropping mechanism of RED, and calculates packet loss according to a preconfigured fuzzy logic by using the queue length and the buffer usage ratio. Theoretical analysis and Network Simulator （NS） simulation results show that the proposed algorithm achieves more throughput and more stable queue length than traditional schemes. It really improves a router＇s ability in network congestion control in IP network.     

主动队列管理机制在无线系统中的优化

主动队列管理(AQM)是对抗拥塞的重要手段,其经典算法之一是随机早期丢弃,简称RED。为使其能适应无线传输高突发误帧的特点,本文提出了一种基于平均队列长度和平均包到达速率的改进RED算法,分析了其相对于传统RED算法在预防和处理拥塞时的优势。同时针对无线信道的时变特性,提出自适应MIR速率调整,以提高频谱利用率和进一步降低拥塞概率,并讨论了其对于系统性能的改善。     

A study of deploying smooth‐ and responsive‐TCPs with different queue management schemes

While there exist extensive research works on congestion control and active queue management, or the joint dynamics of a congestion control strategy with the random early detection (RED) algorithm, little has been done on the interactions between different window adjustment strategies and different queue management schemes such as DropTail and RED. In this paper, we consider a spectrum of TCP‐friendly additive increase and multiplicative decrease (AIMD) parameters. At the one end of this spectrum, smooth‐TCP enhances smoothness for multimedia applications by reducing the window decrease ratio upon congestion, at the cost of the additive increase speed and the responsiveness to available bandwidth. At the other end, responsive‐TCP enhances the responsiveness by increasing the additive increase speed, at the cost of smoothness. We investigate the network dynamics with various combinations of AIMD parameters and queue management schemes, under different metrics. The investigation is conducted from the deployment (especially incremental deployment) point of view. We discussed the impact of the interactions on the goodput, fairness, end‐to‐end delay, and its implications to energy consumption on mobile hosts. Copyright © 2008 John Wiley & Sons, Ltd.     

Proxy‐RED: an AQM scheme for wireless local area networks

Wireless access points (APs) act as bridges between wired and wireless networks. Since the actually available bandwidth in wireless networks is much smaller than the bandwidth in wired networks, there is a disparity in channel capacity which makes the access point a significant network congestion point in the downstream direction. A current architectural trend in wireless local area networks (WLAN) is to move functionality from APs to a centralized gateway in order to reduce cost and improve features. In this paper, we study the use of RED, a well known active queue management (AQM) scheme, and explicit congestion notification (ECN) to handle bandwidth disparity between the wired and the wireless interface of an access point. Then, we propose the Proxy‐RED scheme, as a solution for reducing the AQM overhead from the access point. Simulations‐based performance analysis indicates that the proposed Proxy‐RED scheme improves the overall performance of a network. In particular, the Proxy‐RED scheme significantly reduces packet loss rate and improves goodput for a small buffer, and minimizes delay for a large buffer size. Copyright © 2006 John Wiley & Sons, Ltd.     

Relative loss rate differentiation: performance of short‐lived TCP flows

The relative differentiated service model provides assurances for the relative quality ordering between service classes, rather than for the actual service level in each class. In this paper, we describe a relative loss rate differentiation scheme where packet drop probabilities are determined according to an active queue management (AQM) mechanism based on random early detection (RED) in a first‐in first‐out (FIFO) queue, are weighted in inverse proportion to the price that the network operator assigns to each service class. Basically, we describe a scheme where relative loss rate differentiation is incorporated directly into AQM. Most TCP flows today, particularly Web flows, can be characterized as short‐lived flows. Using simulations with short‐lived TCP flows, we show that the scheme is very effective in ensuring relative loss rate differentiation between service classes during times of network congestion. Copyright © 2004 John Wiley & Sons, Ltd.     

SABlue:一种带加速因子的自适应AQM算法

该文在分析SBlue算法的基础上,提出了一种带加速因子的自适应AQM算法SABlue(Self-tune Accelerate Blue)。算法将瞬时队长作为早期拥塞检测参量,根据队列负载因子控制丢包步长,实现丢包概率幅度的自适应调整,最终将路由队列长度稳定在目标区域内。为了提高网络突变跨度较大情况时算法的响应速度,在队列警戒区域内引入了加速因子。实验表明,SABlue面对突变流和不同RTT的网络场景,队列收敛时间短,丢包率小,且具有较好的鲁棒性,算法综合性能优于其他AQM算法。     

几种主动式队列管理算法的比较研究

主动式队列管理(Active Queue Management,AQM)技术是IETF为了解决Internet拥塞控制问题而提出的一种路由器缓存管理技术.本文对几种主要AQM算法RED、BLUE、ARED和SRED的性能在基于ns-2仿真实验的基础上进行了比较研究.研究的性能包括队列长度、丢包概率、丢包率、连接数对吞吐量的影响及缓冲区大小对链路利用率的影响等.仿真结果表明BLUE、ARED和SRED在这几方面的性能都要优于RED算法.     

Advances in internet congestion control

In this survey, we first review the concept of congestion control with a focus on the Transmission Control Protocol⁄Internet Protocol (TCP⁄IP). We describe many recently proposed algorithms to combat congestion and improve performance, particularly active queue management (AQM) algorithms such as random early detection (RED) and its variants. We then survey control-theoretic analysis and design of TCP congestion control with an AQM scheme. In addition, we discuss three problems associated with AQM proposals: parameter setting, the insensitivity to the input traffic load variation, and the mismatch between macroscopic and microscopic behavior of queue length dynamics. As alternatives to AQM algorithms, we also survey architectural approaches such as modification of source or network algorithms, and economic approaches including pricing or optimization of allocated resources. Finally, we list many open issues that persist in the design, operation, and control of the Internet.     

A novel adaptive traffic prediction AQM algorithm

In the Internet, network congestion is becoming an intractable problem. Congestion results in longer delay, drastic jitter and excessive packet losses. As a result, quality of service (QoS) of networks deteriorates, and then the quality of experience (QoE) perceived by end users will not be satisfied. As a powerful supplement of transport layer (i.e. TCP) congestion control, active queue management (AQM) compensates the deficiency of TCP in congestion control. In this paper, a novel adaptive traffic prediction AQM (ATPAQM) algorithm is proposed. ATPAQM operates in two granularities. In coarse granularity, on one hand, it adopts an improved Kalman filtering model to predict traffic; on the other hand, it calculates average packet loss ratio (PLR) every prediction interval. In fine granularity, upon receiving a packet, it regulates packet dropping probability according to the calculated average PLR. Simulation results show that ATPAQM algorithm outperforms other algorithms in queue stability, packet loss ratio and link utilization.     

FQL‐RED: an adaptive scalable schema for active queue management

In a potentially congested network, random early detection (RED) active queue management (AQM) proved effective in improving throughput and average queuing delay. The main disadvantage of RED is its sensitive parameters that are impossible to estimate perfectly and adjust manually because of the dynamic nature of the network. For this reason, RED performs differently during different phases of a scenario and there is no guarantee that it will have optimal performance. Giving adaptability to RED has been the subject of broad research studies ever since RED was proposed. After a substantial study of AQM schemes and presenting a novel categorization for so‐called modern approaches utilizing artificial intelligence tools to improve AQM, this paper proposes an algorithm enhancing RED as an add‐on patch that makes minimal changes to the original RED. Being built on the basis of AQM schemes like ARED and Fuzzy‐RED, this algorithm inherits adaptability and is able to adjust RED inaccurate parameters regarding network traffic status, trying to optimize throughput and average queuing delay in a scenario. This algorithm is a Q‐learning method enhanced with a fuzzy inference system to provide RED with self‐adaptation and improved performance as a result. Given the name of FQL‐RED, this algorithm outperformed RED, ARED, and Fuzzy‐RED, as the OPNET simulations show. Copyright © 2010 John Wiley & Sons, Ltd.     

基于平均队列长度和滞留时间的RED算法

在无线通信网络环境下，提出了一种改进的基于平均队列长度和滞留时间的RED算法。这种算法根据平均队列长度和滞留时间计算数据包的丢弃概率，比传统的单纯基于平均队列长度的RED算法相比较，能更有效地实现无线网络中的拥塞控制。     

An effective network congestion control method for multilayer network

The congestion control problem in a single node network has been solved by the nonlinear feedback control method,which has been proven to be effective and robust for different router’s queue size.However,these control models are based on the single layer network architecture,and the senders and receivers are directly connected by one pair of routers.With the network architecture being more and more complex,it is a serious problem how to cooperate many routers working in the multilayer network simultaneously.In this paper,an effective Active Queue Management（AQM）scheme to guarantee the stability by the nonlinear control of imposing some restrictions on AQM parameter in multilayer network is proposed.The nonlinear control can rely on some heuristics and network traffic controllers that appear to be highly correlated with the multilayer network status.The proposed method is based on the improved classical Random Early Detection（RED）differential equation and a theorem for network congestion control.The theorem proposed in the paper proved that the stability of the fluid model can effectively ensure the convergence of the average rate to its equilibrium point through many routers in multilayer network.Moreover,when the network capacity is larger,the proposed scheme can still approach to the fullest extensibility of utilization and ensure the stability of the fluid model.The paper reveals the reasons of congestion control in multilayer network,provides a theorem for avoiding network congestion,and gives simulations to verify the results.     

Virtual rate control algorithm for active queue management in TCPnetworks

A virtual rate control (VRC) algorithm for active queue management (AQM) to regulate the queue length with small variation and to achieve high utilisation with small packet loss is proposed. Through ns simulations, the effectiveness of the proposed VRC algorithm as compared with several well-known AQM schemes such as random early detection (RED), random exponential marking (REM), and adaptive virtual queue (AVQ) algorithms is shown     

DRED‐MP: Queue management with multiple levels of drop precedence

There is current interest in differentiated service architectures where packets with different priorities can share the same queue. In the case of congestion, packets marked with higher drop probability are preferentially dropped in order to make buffer room for packets marked with lower drop probability. Active queue management (AQM) based on randomized packet dropping has become a key component of this packet forwarding model. This paper extends our previously developed AQM algorithm called DRED with multiple packet drop precedence to allow for priority treatment of traffic in a network. The main advantage of using the DRED algorithm is the lower parameter configuration complexity it offers and the ease of configuration for a wide range of network conditions. Copyright © 2004 John Wiley & Sons, Ltd.     

一种参数自适应的主动队列管理算法-自适应BLUE

BLUE算法是一种典型的主动队列管理(Active Queue Management,AQM)算法,研究表明BLUE算法优于RED算法.BLUE算法使用丢包事件和链路空闲事件控制网络拥塞.但由于BLUE算法在参数设置方面存在不足,尤其是当TCP连接数突然剧烈变动时,容易导致队列溢出或空闲的频繁发生.该文引进参数自适应机制,提出了自适应BLUE算法,并借鉴了RED算法的早期拥塞检测机制.NS仿真实验表明该算法能有效保持队列长度的稳定,减少队列溢出或空闲现象的发生,在提高链路利用率的同时降低丢包率.     

Random early detection gateways for congestion avoidance

The authors present random early detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gateway or by setting a bit in packet headers. When the average queue size exceeds a present threshold, the gateway drops or marks each arriving packet with a certain probability, where the exact probability is a function of the average queue size. RED gateways keep the average queue size low while allowing occasional bursts of packets in the queue. During congestion, the probability that the gateway notifies a particular connection to reduce its window is roughly proportional to that connection's share of the bandwidth through the gateway. RED gateways are designed to accompany a transport-layer congestion control protocol such as TCP. The RED gateway has no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways     

Modeling and Analysis of Active Queue Management Schemes under Bursty Traffic

Traffic congestion arising from the shared nature of uplink channels in wireless networks can cause serious problems for the provision of QoS to various services. One approach to overcome these problems is to implement some effective congestion control mechanisms at the downlink buffer at the mobile network link layer or at gateways on the behalf of wireless network access points. Active queue management (AQM) is an effective mechanism to support end-to-end traffic congestion control in modern high-speed networks. Initially developed for Internet routers, AQM is now being also considered as an effective congestion control mechanism to enhance TCP performance over 3G links. This paper proposes an analytical performance model for AQM using various dropping functions. The selection of different dropping functions and threshold values required for this scheme plays a critical role on its effectiveness. The model uses a well-known Markov-modulated Poisson process (MMPP) to capture traffic burstiness and correlations. The validity of the model has been demonstrated through simulation experiments. Extensive analytical results have indicated that exponential dropping function is a good choice for AQM to support efficient congestion control.     

RED gateway congestion control using median queue size estimates

This paper focuses on the queue size estimation problem in random early detection (RED) gateways. Queue size estimation plays a fundamental role in the congestion control dynamics of RED, as it determines gateways' awareness of network congestion, which in turn determines the packet dropping/marking decision. Conventional RED gateways use exponentially weighted moving averages (EWMA) to estimate the queue size. These infinite impulse response (IIR) filters require very small EWMA weights in order to effectively avoid nonlinear instabilities in RED and to filter out bursty increases in the queue size. While small EWMA weights enable gateways to accommodate transient congestion, they also lead to gateways' failure to closely track rapid queue size depletion and thus causes link under utilization. We investigate the use of simple nonlinear queue size estimators. In particular, we study the congestion control dynamics of a network where adaptive weighted median filters are used for queue size estimation by the gateways. Analytical results for the expected queue size in the steady state are derived. Under this new queue size estimation framework, design guidelines for the remaining RED parameters are provided. Simulation results show that the proposed algorithm provides greater network power, better prevention of global synchronization, and a fairer treatment to bursty traffic than the RED algorithm does.     

A compensated PID active queue management controller using an improved queue dynamic model

Beside the major objective of providing congestion control, achieving predictable queuing delay, maximizing link utilization, and robustness are the main objectives of an active queue management (AQM) controller. This paper proposes an improved queue dynamic model while incorporating the packet drop probability as well. By applying the improved model, a new compensated PID AQM controller is developed for Transmission Control Protocol/Internet Protocol (TCP/IP) networks. The non‐minimum phase characteristic caused by Padé approximation of the network delay restricts the direct application of control methods because of the unstable internal dynamics. In this paper, a parameter‐varying dynamic compensator, which operates on tracking error and internal dynamics, is proposed to not only capture the unstable internal dynamics but also reduce the effect of uncertainties by unresponsive flows. The proposed dynamic compensator is then used to design a PID AQM controller whose gains are obtained directly from the state‐space representation of the system with no further gain tuning requirements. The packet‐level simulations using network simulator (ns2) show the outperformance of the developed controller for both queuing delay stability and resource utilization. The improved underlying model leads also to the faster response of the controller. Copyright © 2013 John Wiley & Sons, Ltd.