Effective RED: An algorithm to improve RED's performance by reducing packet loss rate

Random early detection (RED) is an effective congestion control mechanism acting on the intermediate gateways. We describe a new active queue management scheme, Effective RED (ERED) that aims to reduce packet loss rates in a simple and scalable manner. We made a few change to packet drop function of existing RED scheme. The rest of the original RED remains unchanged. We achieve this by making several refinements and by controlling packet dropping function both with average queue size and instantaneous queue size. Simulations demonstrate that ERED achieves a highest throughput and lowest packet drops than RED, Blue, REM, FRED, LDC and SRED. Since ERED is fully compatible with RED, we can easily upgrade/replace the existing RED implementations by ERED.     

Design and analysis of a self-tuning feedback controller for the Internet

Active queue management (AQM) is an effective method used in Internet routers for congestion avoidance, and to achieve a tradeoff between link utilization and delay. The de facto standard, the random early detection (RED) AQM scheme, and most of its variants use average queue length as a congestion indicator to trigger packet dropping. This paper proposes a novel packet dropping scheme, called self-tuning proportional and integral RED (SPI-RED), as an extension of RED. SPI-RED is based on a self-tuning proportional and Integral feedback controller, which considers not only the average queue length at the current time point, but also the past queue lengths during a round-trip time to smooth the impact caused by short-lived traffic dynamics. Furthermore, we give theoretical analysis of the system stability and give guidelines for selection of feedback gains for the TCP/RED system to stabilize the average queue length at a desirable level. The proposed method can also be applied to the other variants of RED. Extensive simulations have been conducted with ns2. The simulation results have demonstrated that the proposed SPI-RED algorithm outperforms the existing AQM schemes in terms of drop probability and stability.     

一种提高稳定性和公平性的主动队列管理机制

结合平均队列和负载衡量拥塞,实现选择性丢包,提出早期选择性丢包算法(ESD)．ESD采用指数函数计算丢包概率,使丢包概率随拥塞程度增大而指数递增;引入记录活跃连接状态信息的虚队列,并在虚队列上假轮转,以检测发送速率大的连接;区分非响应性连接和响应性连接,挑选丢包的候选连接,拥塞时优先丢弃候选连接在队列头部的数据包．实验结果表明,ESD可提高队列稳定性,降低Web流和RTT较大连接的丢包率,提高连接占用带宽的公平性,缩短应用响应时间．     

RED算法的稳定性:基于非线性控制理论的分析

随机旱期检测（Radom Erly Detection,ERD)算法是主动队列管理（ActiveQueue Management,AQM)的有效实现算法，有关它性能的研究是近来网络研究的一个热点，在某些网络配置和负载状态下，RED存在稳定性问题，已有的关于RED稳定性的研究用不同的方法，从不同的角度定性或定量地揭示了可能的原因，并给出了稳定运行的工作区间，但没有对等幅振荡的队列行为给出一个合理的解释，在该文中，作者利用描述函这一非线性控制理论中经典的分析方法，分析了RED和getle-RED的工作特性，认为分组丢弃概率曲线中的非线性结构诱发的自激振荡是队列呈现周期运动的本质原因；虽然相比较而言，getle-RED比RED有更宽的稳定工作区间，但也是非常有限公司，解决AQM稳定性的理想途径是设计更为鲁棒的线性控制器。     

A novel self-tuning feedback controller for active queue management supporting TCP flows

Wireless access points act as bridges between wireless and wired networks. Since the actually available bandwidth in wireless networks is much smaller than that in wired networks, there is a bandwidth disparity in channel capacity which makes the access point a significant network congestion point. The recently proposed active queue management (AQM) is an effective method used in wired network and wired-wireless network routers for congestion control, and to achieve a tradeoff between channel utilization and delay. The de facto standard, the random early detection (RED) AQM scheme, and most of its variants use average queue length as a congestion indicator to trigger packet dropping. In this paper, we propose a Novel autonomous Proportional and Differential RED algorithm, called NPD-RED, as an extension of RED. NPD-RED is based on a self-tuning feedback proportional and differential controller, which not only considers the instantaneous queue length at the current time point, but also takes into consideration the ratio of the current differential error signal to the buffer size. Furthermore, we give theoretical analysis of the system stability and give guidelines for the selection of feedback gains for the TCP/RED system to stabilize the instantaneous queue length at a desirable level. Extensive simulations have been conducted with ns2. The simulation results have demonstrated that the proposed NPD-RED algorithm outperforms the existing AQM schemes in terms of average queue length, average throughput, and stability.     

Reduction of queue oscillation in the next generation Internet routers

The Internet routers employing the random early detection (RED) algorithm for congestion control suffer from the problem of chaotic queue oscillation. It is well known that the slowly varying nature of the average queue size computed using an exponentially weighted moving average (EWMA) used in the RED scheme causes this chaotic behavior. This paper presents a new mathematical function to model the weighting parameter used in the EWMA. The proposed weighting function incorporates the knowledge of the dynamic changes in the congestion characteristics, traffic characteristics and queue normalization. Using this pragmatic information eliminates the slowly varying nature of the average queue size. It is evident from our simulations that the proposed approach not only reduces the chaotic queue oscillation significantly but also provides predictable low delay and low delay jitter with high throughput gain and reduced packet loss rate even under heavy load of traffic conditions.     

改进的随机早期检测非线性算法

主动队列管理是目前的研究热点,随机早期检测(RED)算法是一种经典的队列管理算法。线性RED算法虽然简单且容易计算,但队列位于最小阈值和最大阈值附近时的丢包概率都不太合理。在论证了平均队列长度和丢包概率间为非线性性质后,提出了一种改进非线性RED算法——JRED。利用NS2对改进的算法进行仿真,结果表明,JRED算法提高了平均吞吐量,降低了丢包概率,增强了网络稳定性和可靠性。     

一种选择性丢包机制的分析与设计

随机早期捡测算法(RED)在产生丢包时简单地丢弃到达的数据包，由于Web流占据了网络上75％左右的带宽，而Web流的特点是数据包比较少，这就使得早期丢包的效果难以体现。本文提出一种选择性丢包机制，引进一个类似公平队列的虚队列，检测发遥速率过大的流，筛选出丢包的候选链接，拥塞时丢弃候选链接在队列申的第一个连接的数据包。模拟实验结果表明，与队头丢包相比，采用选择性丢包的RED算法可进一步降低网关的丢包率，提高吞吐率，缩短Http的响应时间，提高队列的稳定性。     

一种链路负载自适应的主动队列管理算法

随机早检测(random early detection,简称RED)是IETF推荐部署的主动队列管理(active queue management,简称AQM)算法.RED存在参数难以配置、无法得到与流量无关的平均队长等问题.ARED(adaptive RED)是RED的自适应版本,它根据平均队长动态调节最大标记概率参数,从而得到稳定的平均队长.但ARED没有克服瞬时队列长度振荡问题,且在动态流量环境下性能明显降低.分析了ARED性能问题的原因,并提出了一种链路负载自适应的主动队列管理算法LARED(load adaptiveRED).LARED具有两个特点:自适应链路负载、快速响应队长变化.分析和仿真实验表明,与ARED等其他AQM算法相比,LARED在保持高链路利用率和低时延的同时可以得到稳定的瞬时队长,并且具有良好的响应性和鲁棒性.     

一种基于负载和队列的模糊主动队列管理算法

针对目前已有的模糊主动队列管理算法(AQM)大多只考虑队列长度及其变化率作为模糊输入,很少同时考虑包到达速率的影响,结合队列长度和包到达速率,提出一种更为有效的模糊主动队列管理算法(FQL-AQM)。FQL-AQM以瞬时队列长度和网络平均负载因子作为模糊输入来调整包丢弃概率,并采用参数自校正技术,将队列长度维持在期望的队列水平上、包到达速率维持在队列服务速率附近,使算法对网络状态的变化具有很好的适应能力,从而提高网络的鲁棒性。仿真结果表明,FQL-AQM算法具有比FQ-AQM算法更快的响应速度、更高的链路利用率和更好的队列稳定性,从而减少了分组延时抖动和分组丢弃率。     

A novel numerical algorithm based on self-tuning controller to support TCP flows

Active queue management (AQM) is an effective method used in Internet routers for congestion control, and to achieve a trade off between link utilization and delay. The de facto standard, the random early detection (RED) AQM scheme, and most of its variants use average queue length as a congestion indicator to trigger packet dropping.     

Design and analysis of an ONOFF variable structure controller for AQM routers supporting TCP flows

Active queue management （AQM） can maintain smaller queuing delay and higher throughput by purposefully dropping packets at intermediate nodes. Most of the existing AQM schemes follow the probability dropping mechanism originating from random early detection （RED）. This paper develops a novel packet dropping mechanism for AQM through designing an ONOFF controller applying the variable structure control theory. Because the binary ONOFF controller can considerably simplify the manipulation on the AQM router, it is helpful for implementing the high performance router. The design principles of ONOFF controller are discussed in detail. The guidelines towards parameter settings are presented. The performance is extensively evaluated and compared with other well-known controllers through simulations and theoretical analysis. The results demonstrate that the ONOFF controller is responsive and robust against external disturbances, and is insensitive to variances of the system parameters. Therefore, it is very suitable for the time- varying network system, and at the same time, it can also keep the instantaneous queue length at a desired level with rather small oscillations, which is conducive to achieving the technical objectives of AQM.     

基于ARED的主动队列管理改进算法

随机早期检测（Random Early Detection,RED）是IETF推荐部署的主动队列管理（Active Queue Management,AQM）算法。 RED存在参数难以配置、无法适应动态网络环境的缺点。 ARED（ Adaptive RED）是RED的自适应版本,通过平均队列长度来动态调整最大丢弃概率,从而达到稳定平均队列长度的目的,但是存在瞬时队列长度振荡的问题。文中研究了拥塞控制中的主动队列管理,对ARED算法进行了改进,优化丢弃概率计算函数,提出TTS-ARED算法,实现在动态网络环境下队列长度的稳定以及丢包率降低。 NS2的仿真结果表明,TTS-ARED算法显著地降低了丢包率,队列长度稳定性比ARED算法更优越。     

应用Logistic方程的RED改进算法

为了降低丢包率,通过对线性增长的随机早期检测(RED)算法进行研究改进,引入了Logistic方程的方法来计算丢包率;并通过仿真实验对LGRED和NLRED的实验结果进行了比较,发现LGRED相对于RED的丢包率降低了约28.83%。实验结果表明：在相同的参数条件下,LGRED算法更加能够控制丢包的发生,提高网络性能。     

NS2中新协议的实现

深入分析了网络仿真器NS2的组成和结构,以及NS2中队列管理算法的实现机制,在此基础上,通过一个新的主动队列管理算法的设计与实现阐述了在NS2中实现新协议、新算法的方法。新算法主要通过更为准确的拥塞检测和更为合理的分组丢弃概率计算来提高主动队列管理算法的稳定性,最后通过仿真实验对新算法的性能进行了测试,实验结果表明新算法的性能要由于RED算法。     

基于RED算法的非线性拥塞控制

由于RED算法是采用丢包率随平均队列长度线性变化的方法,因此导致网络在拥塞并不严重的时候丢包率较大,在拥塞比较严重的时候丢包率较小,拥塞控制能力较低。该文提出非线性平滑算法通过对RED算法的丢包率函数进行非线性平滑,在最小阈值时丢包率增长速度比较小,在最大阈值时丢包率增长速度比较大,有效地控制了平均队列长度,具有较好的拥塞控制能力。NS2仿真结果表明该算法对丢包率、端到端时延、吞吐量以及时延抖动等性能均有较明显的提高。     

改进的RED队列管理算法：RED-r

为了避免RED缺陷,提出一种改进的RED算法——RED-r。该算法采用二次圆函数来计算丢包概率,减少了RED的设置参数,实现了在网络大延时和小延时时的队列稳定,且在小延时能获得比PID队列更平滑的效果。NS2仿真验证了RED-r算法的有效性。     

A framework to determine bounds of maximum loss rate parameter of RED queue for next generation routers

Random early detection (RED) is expected to eliminate global synchronization by random active packet drop. Its packet drop probability is decided by the maximum packet drop probability in its drop function, buffer thresholds, and average queue length. It has been observed that for a large number of connections, a small value of the maximum packet drop probability may not eliminate global synchronization. Furthermore, since RED uses four parameters to regulate its performance, it is necessary to relate its maximum drop probability with those parameters. The objective of this paper is to develop a framework for the bounds of the maximum drop probability of RED, based on TCP channel model and traffic characteristics. The value of the maximum drop probability obtained by our model will make RED queue achieve its targeted goals.     

FLRED: an efficient fuzzy logic based network congestion control method

The number of applications running over computer networks has been increasing tremendously, which increased the number of packets running over the network as well leading to resource contention, which ultimately results in congestion. Congestion increases both delay and packet loss while reducing bandwidth utilization and degrading network performance. Network congestion can be controlled by several methods, such as random early detection (RED), which is the most well-known and widely used method to alleviate problems caused by congestion. However, RED and its variants suffer from linearity and parametrization problems. In this paper, we proposed a new method called fuzzy logic RED (FLRED), which extends RED by integrating fuzzy logic to overcome these problems. The proposed FLRED method relies on the average queue length (aql) and the speculated delay (D _Spec ) to predict and avoid congestion at an early stage. A discrete-time queue model is used to simulate and evaluate FLRED. The results showed that FLRED outperformed both RED and effective RED (ERED) by decreasing both delay and packet loss under heavy congestion. Compared with ERED and RED, FLRED decreased the delay by up to 1.5 and 4.5% and reduced packet loss by up to 6 and 30%, respectively, under heavy congestion. These findings suggest that FLRED is a promising congestion method that can save network resources and improve overall performance.