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 pre- dominance 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. Theo- retical 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.

An Active Queue Management Algorithm: CRED

By applying the method of average and variance, a new queue management algorithm named the Classified-Random Early Detection （CRED） algorithm is presented which can identify the media streaming, TCP traffic and other UDP traffic at the edge routers. The algorithm discriminates the slow start and the congestion control phase of the TCP traffic and combines the TCP congestion control with the IP congestion control to alleviate the congestion effectively. Simulation shows that CRED can not only make the media streaming obtain the resources needed but also protect the TCP traffic transmitted effectively and reliably.

Fuzzy variable structure algorithms for active queue management with delay compensation

Based on the linearized model of the TCP connections through the congested routers, this paper puts forward an active queue management algorithm (FVS-T). The algorithm utilizes the fuzzy variable structure control algorithm with delay factor to compensate time varying round-trip times (RTT) and uncertainties with respect to the number of active TCP sessions. By analyzing the robustness and performance of the control scheme for the nonlinear TCP/AQM model, we show that the proposed design has good performance and robustness, which are central to the notion of AQM. Implementation issues were discussed and ns simulations were provided to validate the design and compare its performance to other peer schemes in different scenarios. The results show that the proposed design significantly outperforms the other congestion schemes in terms of packet loss ratio, throughput and buffer fluctuation.

Active Queue Management技术的研究与发展

Active Queue Management(AQM)技术通过有效控制输出队列的丢包时间和丢包方式,对拥塞进行早期通告,这在TCP拥塞控制的实现中至关重要。目前对AQM进行较全面介绍和总结的文献尚不多见,以RandomEarly Detection(RED)为重点介绍了这种第一代AQM技术的设计思想、优缺点以及为此出现的多种RED变种方法,另外还简单介绍了其它几种与RED设计思路不同的AQM方法,以期对AQM技术的研究和发展进行较全面的总结,并促进国内学者以及设备制造商对这一技术的关注。

Traffic Queuing Management in the Internet of Things: An Optimized RED Algorithm Based Approach

Congestion control is one of the main obstacles in cyberspace traffic.Overcrowding in internet traffic may cause several problems;such as high packet hold-up,high packet dropping,and low packet output.In the course of data transmission for various applications in the Internet of things,such problems are usually generated relative to the input.To tackle such problems,this paper presents an analytical model using an optimized Random Early Detection(RED)algorithm-based approach for internet traffic management.The validity of the proposed model is checked through extensive simulation-based experiments.An analysis is observed for different functions on internet traffic.Four performance metrics are taken into consideration,namely,the possibility of packet loss,throughput,mean queue length and mean queue delay.Three sets of experiments are observed with varying simulation results.The experiments are thoroughly analyzed and the best packet dropping operation with minimum packet loss is identified using the proposed model.

基于AQM算法的通信电源智能管理系统设计

在现代通信系统中,电源管理的效率和智能化水平直接影响到系统的稳定性和能效。主动队列管理(Active Queue Management,AQM)算法作为一种先进的网络数据流控制技术,通过动态调整队列的行为来优化数据传输和降低延迟。该算法主要用于改善网络拥塞,但近年来被引入通信电源管理,用于优化电源的分配和使用,增强系统的响应能力和效率。文章设计一个基于AQM算法的通信电源智能管理系统,详细阐述系统的需求、架构设计以及模块划分,并通过系统集成与应用测试验证设计的有效性。通过引入AQM算法,设计系统能够实现电源管理的动态优化,从而提升整个通信系统的性能和可靠性。

Diffserv AQM algorithm for edge and core routers

The existing active queue management （AQM） algorithm acts on subscribers and edge routers only, it does not support differentiate-serve （Diffserv） quality of service （QoS）, while the existing diffserv QoS has not considered the link capacities between edge routers and connected core routers. When a core router in a two layers’ network experiences congestion, the connected edge routers have no ability to adjust their access data rates. Thus, it is difficult to achieve the congestion control for the large scale network with many edge routers and core routers. To solve these problems, two difffserve AQM algorithms are proposed for the congestion control of multilayer network. One diffserv AQM algorithm implements fair link capacities of edge routers, and the other one implements unequal link capacities of edge routers, but it requires the core routers to have multi-queues buffers and Diffserv AQM to support. The proposed algorithms achieve the network congestion control by operating AQM parameters on the conditions of proposed three theorems for core and edge routers. The dynamic simulation results demonstrate the proposed control algorithms for core and edge routers to be valid.

基于流量自相似性的网络队列管理算法

网络流量的自相似性会导致数据突发状态持续,传统队列管理算法无法对网络流量突发状态进行预测,从而影响网络端到端时延、丢包率和吞吐性能。针对该问题,提出一种基于网络流量预测的主动队列管理算法P-ARED。基于网络流量的均值和方差给出网络流量等级的概念,讨论网络流量等级转移概率与Hurst参数之间的关系,提出基于贝叶斯估计思想的网络流量等级预测方法。在此基础上,在对自相似网络流量环境下的平均队列长度、缓存队列长度最小阈值等参数优化设置的基础上,基于Hurst参数和自相似流量等级预测结果,重新设计ARED算法中分组丢弃概率的计算方法,以提高缓存队列长度的稳定性。仿真结果表明,P-ARED算法与对比的主动队列管理算法相比,降低了网络端到端时延和丢包率,提高了端到端吞吐性能,其中平均吞吐量最高提升7.63%,平均时延最多降低17.52%。

不确定时滞TCP/AQM系统的滑模控制

针对具有非匹配不确定项和输入时滞的TCP线性化动态系统进行特殊线性变换,将原不确定时滞系统转化为无时滞系统.在新坐标下,基于滑模控制(SMC)设计了一种主动队列管理(AQM)算法.根据滑模到达条件设计了一种控制策略,基于LMI技术给出线性滑动超平面的设计方法,通过Lyapunov函数证明了系统的稳定性.仿真结果表明,该算法可以使队列长度快速收敛到设定值,同时维持较小的队列振荡,尤其是在网络条件变化的情况下,该方法优于传统的滑模控制,能实现准确的跟踪,具有良好的鲁棒性.

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

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

一种新的快速响应的AQM算法

该文应用控制理论,设计了具有快速响应特征的比例积分(Proportional-Integral,PI)控制器,并以此提出了一个新的主动队列管理(Active Queue Management,AQM)算法,称为ActivePI算法(简称A-PI)。A-PI用一组参数实现快速响应,用另一组参数保证队长稳定,使用门限值实现两组参数间平滑切换,算法实现简单。理论分析和仿真实验表明,A-PI算法在保证队长稳定的同时实现了对不同网络环境的快速响应。

自相似网络流量可预测性及其在AQM中的应用

从网络流量的自相似性带来的可预测性入手,小结了两类常用的预测方法,并对其进行了比较;然后根据已有预测算法,将预测结果引入经典主动队列管理机制——RED算法中,提出了基于流量预测的RED算法;最后通过仿真实验表明,该算法能较好地控制平均队列长度,提高主动队列管理的性能。

一种基于优先级的卫星网络AQM算法

针对卫星网络大带宽、长时延、高误码等特点,结合控制理论,提出了一种基于优先级的卫星网络主动队列管理(active queue management,AQM)算法。首先,借鉴控制理论中比例-积分-微分(propertional-inte-gral-derivative,PID)控制器设计方法计算总的报文丢弃概率;然后,针对IN和OUT两种不同优先级报文定义不同的丢弃概率,以实现不同优先级业务流量的区分服务。仿真实验表明,相对于低优先级流量,高优先级业务在保持高吞吐量的同时具有较低的报文丢失率,且整体队列长度抖动小,从而实现高优先级流量报文的有效保护。

基于速率和队长的大时滞网络AQM算法

针对网络拥塞控制系统在大时滞网络中产生的不利影响,提出一种基于速率和队长的大时滞网络AQM算法。该算法采用缓冲区队列长度和包到达速率作为网络拥塞的判别依据,在结合Smith预估的模糊PID控制方法中加入速率控制项。仿真表明该算法在大时滞和网络动态变化的环境中拥塞响应较快、收敛时间短,并能较好地将队列长度稳定到期望值附近,提高缓冲区的利用率。

高速TCP/AQM中的RED算法分析

通过建立适用于高速TCP和AQM反馈控制系统的流体流模型,分析高速TCP/AQM闭环系统的稳定性。采用频域稳定裕度,得到高速TCP/AQM中RED算法的稳定参数区域。基于MATLAB/SIMULINK的仿真结果验证了该方法的有效性。

Internet路由器的AQM策略的研究与分析

分析了几种典型及最新提出的AQM策略算法,并比较了各种策略算法的优缺点,同时对AQM的拥塞指示方式进行了分析,最后给出了几种AQM策略的实验分析结果。

HSTCP/AQM模型中PI控制参数的研究

通过建立适用于HSTCP和AQM反馈控制系统的流体流模型,在模型的控制部分采用PI算法。对于PI算法的控制参数采用频率域稳定裕度的方法确定。通过NS-2仿真,验证设计的拥塞控制方法,在高速网络环境下具有良好的拥塞控制性能。

基于NLMS算法的自适应AQM控制机制的研究

针对RED算法在网络拥塞控制中使得队列波动较大的缺点,提出了一种归一化最小均方(NLMS)算法,并研究了NLMS算法在主动队列管理中的具体实现。仿真实验通过对NLMS算法、RED算法、REM算法、LRC-RED算法性能的比较,表明NLMS算法具有较好的动静态性能,且能够提高队列稳定性,降低丢包率。

稳定裕度与网络特征参数无关的AQM算法

针对现有基于控制论的主动队列管理（AQM）算法的不足，设计一种稳定裕度与网络特征参数（往返时延、通过瓶颈链路的TCP连接数、瓶颈链路的容量）无关的基于PI控制器的AQM算法GPM—PI。该算法响应速度快、计算开销小，能用于大时滞网络环境，抗干扰能力强（对TCP短流和UDP流有良好的控制能力），鲁棒性好，能更好地适应Internet环境下的主动队列管理。

典型AQM算法的性能评价模型

利用GI/M/1/N排队系统和Internet业务流量自相似性的特点建立了一个评价AQM算法在非响应业务流量下性能的分析模型,提出了利用模型的分析计算结果而不是模拟或实验手段评价AQM算法性能的新方法.同模拟或实验手段相比,该方法能更深刻地刻画AQM算法在实际网络环境中的性能.用该模型分析比较3个经典的AQM算法——TD、RED和GRED的性能,所得的结果同其他研究者利用模拟或实验方法所得的结果一致.