Multi-indicator Active Queue Management Method

A considerable number of applications are running over IP networks. This increased the contention on the network resource, which ultimately results in congestion. Active queue management (AQM) aims to reduce the serious consequences of network congestion in the router buffer and its negative effects on network performance. AQM methods implement different techniques in accordance with congestion indicators, such as queue length and average queue length. The performance of the network is evaluated using delay, loss, and throughput. The gap between congestion indicators and network performance measurements leads to the decline in network performance. In this study, delay and loss predictions are used as congestion indicators in a novel stochastic approach for AQM. The proposed method estimates the congestion in the router buffer and then uses the indicators to calculate the dropping probability, which is responsible for managing the router buffer. The experimental results, based on two sets of experiments, have shown that the proposed method outperformed the existing benchmark algorithms including RED, ERED and BLUE algorithms. For instance, in the first experiment, the proposed method resides in the third-place in terms of delay when compared to the benchmark algorithms. In addition, the proposed method outperformed the benchmark algorithms in terms of packet loss, packet dropping, and packet retransmission. Overall, the proposed method outperformed the benchmark algorithms because it preserves packet loss while maintaining reasonable queuing delay.     

ACK报文拥塞对网络性能影响的研究

为了提高网络性能和安全、设计更有效地队列拥塞控制算法,通过研究现有的一些主动队列拥塞控制算法发现:大多数的拥塞控制算法的实现是基于队列长度或平均队列长度,这使得算法在提高网络整体性能上具有局限性。本文在现有的网络队列拥塞控制算法的基础上,将ACK信息确认报文传输状态引入到队列拥塞控制算法研究的系统中,通过仿真实验发现:ACK数据报文的传输状态在很大程度上影响着网络的吞吐量、数据包的传输延迟等。     

高带宽无线局域网中PI速率控制算法

针对传统传输控制协议（TCP）在高带宽、无线网络中性能表现不佳的问题, 建立了一个端到端的虚拟路由器模型, 提出了一个端到端的发送端比例积分（PI）速率控制算法。根据RTT的变化, 利用PI控制器计算发送端的发送速率, 使瓶颈节点的队长稳定在一个目标位置, 减少拥塞丢包, 避免无线链路错误丢包引起的对拥塞窗口的错误调整。仿真结果表明, 与传统拥塞控制协议相比, 新机制能较好地控制路由器队长、提高网络负载的稳定性和网络吞吐率。     

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.     

一种采用价格机制的无线接入网络拥塞控制策略

由于无线接入网络中存在着时延大、吞吐量小、丢包率高等特性,传统的AQM拥塞机制难以应用于有线/无线异构网络。本文通过分析经典的随机指数标记算法(REM)中价格的产生机制,指出了其存在的不足,并通过引入队列缓存比对REM价格使其更能适应无线环境,从而提出了一种新的基于价格的拥塞控制策略—PREM。PREM利用队列缓存比和链路虚拟容量作为拥塞度量指标。最后,通过NS2仿真平台对所提算法进行了验证,与传统的有线拥塞控制经典算法REM算法、PI算法和无线Prox-y-RED算法做了对比实验,最后证实该算法能有效减少丢包现象。     

EasiCC:一种保证带宽公平性的传感器网络拥塞控制机制

实用的传感器网络拥塞控制方案不仅需要满足多项网络性能指标,而且必须控制开销很小,提出了一种满足上述要求的拥塞控制机制EasiCC(EasiNet congestion control mechanism).在EasiCC中,数据流源节点将数据报文按比例划分到各优先等级中,各网络节点根据网络拥塞程度动态地、同步地调整报文过滤标准,结合报文过滤标准和报文优先级来调节网络流量,保证了无线信道带宽分配上的公平性;将网络准入控制和队列丢包手段相结合来调整网络流量,保证了网络综合性能指标.EasiCC控制开销很少,已在实际传感器网络平台中实现.模拟验证和实验测试结果显示,EasiCC能够公平地为各数据流分配发报速度和网络带宽,并且在报文传输成功率、传输延迟等性能指标上均有良好的表现.     

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.     

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

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

Performance evaluation for DRED discrete-time queueing network analytical model

Due to the rapid development in computer networks, congestion becomes a critical issue. Congestion usually occurs when the connection demands on network resources, i.e. buffer spaces, exceed the available ones. We propose in this paper a new discrete-time queueing network analytical model based on dynamic random early drop (DRED) algorithm to control the congestion in early stages. We apply our analytical model on two-queue nodes queueing network. Furthermore, we compare between the proposed analytical model and three known active queue management (AQM) algorithms, including DRED, random early detection (RED) and adaptive RED, in order to figure out which of them offers better quality of service (QoS). We also experimentally compare the queue nodes of the proposed analytical model and the three AQM methods in terms of different performance measures, including, average queue length, average queueing delay, throughput, packet loss probability, etc., aiming to determine the queue node that offers better performance.     

移动延迟容忍传感网络拥塞控制算法研究

针对移动延迟容忍传感网络拥塞而造成的节点内缓存数量预测不准,数据传输延时速度过慢,数据分组投递成功率低等问题,提出一种移动延迟容忍传感网络拥塞控制算法。算法是基于节点状态感知的,构建移动延迟容忍传感网络拥塞预测机制,依据机制中所获取的历史缓存信息感知节点状态,对拥塞严重或中度拥塞的节点缓存队列内的数据进行信息聚合,提出拥塞控制的策略。最后通过仿真可得数据分组投递率、数据分组丢包率及响应时间、消息产生率。实验结果表明,所提出的拥塞控制算法能够预测缓存数量准确,减少数据传输时延,保证数据分组投递成功率,提高整个网络的工作效率。     

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.

     

无线网络中一种智能控制的组播拥塞控制机制

针对现有组播拥塞控制算法应用到无线网络中存在的性能下降问题,提出一种基于新的智能组播拥塞控制机制ECMCC。ECMCC机制根据网络相对队列时延和数据包丢失检测网络的拥塞状态,采用代表集合机制反馈信息,利用专家控制器的推理判断区分丢包原因和当前的网络状态,进而采取不同的控制策略调节组播源端发送速率。仿真结果表明,ECMCC机制收敛速度快、灵敏性好、速率变化平滑,在有线网络中具有良好的TCP友好性。同时,ECMCC能有效区分网络拥塞和随机差错,提高了网络的吞吐量,适用于无线网络环境,且在无线网络较低误码率时具有一定的TCP友好性。     

基于改进BBR的数据报拥塞控制协议

数据报拥塞控制协议(Datagram Congestion Control Protocol,DCCP)是提供拥塞控制和不可靠传输特点的实时多媒体基础协议,DCCP中的CCID2算法仍然采用AIMD的控制机制,这种传统的Loss-Base拥塞控制模型已经不适用于目前高BDP的网络环境,容易引起缓冲区膨胀现象,导致网络延迟增加和抖动等问题.与Loss-Base的算法相比,BBR算法可以有效地控制网络延时,最大限度避免网络排队的情况,在丢包率较高的情况下仍可以保持一定的带宽利用率和较低的链路延时,因此适合于DCCP实时流媒体的应用的协议.本文在DCCP中引入了BBR算法并做相应的改进,增加了丢包率检测模型,使用延时与带宽积模型的拥塞控制算法对上述问题进行改进.通过模拟实验证明,本方法在高负载情况下连接的平均延迟相比CCID2降低了20%,在丢包率较高的环境下也能保持良好的吞吐量.     

一种改进ARED拥塞控制算法的实现

随着互联网的迅速发展,无论是网民人数还是上网设备数都呈现高速增长的态势。虽然带宽等互联网基础资源相比二十年前有了质的飞跃,但是由于网络规模的增加还是带来了一系列的问题,其中网络拥塞是比较典型的一个。RED作为路由器主动队列管理策略中的重要算法已经在网络拥塞控制方面起到了很好的效果,成为IETF RFC2309建议的唯一候选算法。与队尾丢弃算法DropTail相比,RED算法具有网络链路利用率较高、吞吐量较大、网络时延和丢包率较小的优点,但其存在参数配置无法适应网络动态变化的缺陷,因而改进的ARED算法增加了自适应的功能,但也存在瞬时队列长度振荡等稳定性问题。对此,研究了RED及ARED拥塞控制算法,并提出了一种改进算法QARED,希望通过优化最大丢包概率计算函数来达到提高平均队列长度稳定性以及降低丢包率的目的。     

结合距离与队列积压的无线Mesh网络拥塞感知路由协议

针对无线Mesh网络中路由的拥塞问题,提出了一种结合距离与队列积压信息的拥塞感知路由协议(DR-CAR)。首先,结合链路质量源路由(LQSR)协议中的距离度量和E-Backpressure协议中的队列积压度量构建一种新的链路质量度量。然后,每个节点通过探测数据包来计算链路质量,并通过控制数据包和其邻居节点进行交互,以此来更新链路质量。最后,节点根据链路质量来选择下一跳节点,从而构建从源节点到目的节点之间的最佳路径。另外,在MAC层中为控制数据包分配最高的优先级,同时保证控制数据包的安全性。仿真实验表明,在不同的链路负载下,该协议在网络传输时延和网络吞吐量方面都具有优越的性能,具有可行性和有效性。     

一种基于蚁群优化的WSN拥塞控制算法*

针对无线传感器网络中由于拥塞引起的丢包和能量过度消耗等问题,提出了一种基于蚁群优化的拥塞控制算法以减轻WSN中的拥塞和改进网络性能。该算法充分考虑了给定时刻WSN的拥塞状况,分成三个阶段在源节点和sink节点间寻找一条最佳的路径,并及时地消除拥塞。仿真实验结果表明,该算法在网络吞吐量、丢包率、时延和能耗方面具有较好的综合网络性能。     

适用于异构网络的改进TCP协议研究

在有线网络中,网络丢包主要是网络拥塞造成的,而传统的TCP协议主要是针对有线网络设计的。对于无线网络,链路错误的随机丢包成为其主要的丢包,传统的TCP已不再适用。为了使TCP适用于有线-无线的异构网络中,提出一种改进的TCP协议(命名为TCP-Ackflag)。此协议通过接收端判断分组数据的相对延迟趋势来判断网络拥塞情况,并在接收端反馈给发送端的ACK包中定义一个拥塞标志位。接收端在接收ACK包中,记录这个拥塞标志位。为了使网络能达到最大吞吐量,发送端只有在发现产生网络丢包现象后再立即对记录的拥塞标志位的值进行检测,通过检测到的拥塞标志位的值来判断网络拥塞情况,最终决定是进入网络拥塞处理过程还是简单地快速重传过程,从而保证了有线-无线异构网络的传输性能。仿真结果表明,此方案对网络拥塞判断准确性和灵敏性都有极大提高,并在此基础上保证了网络传输性能。     

Dynamic queue level control of TCP/RED systems in AQM routers

One main TCP congestion control objective is, by dynamically adjusting the source window size according to the router queue level, to stabilize the buffer queue length at a given target, thereby achieving predictable queueing delay, reducing packet loss and maximizing link utilization. One difficulty therein is the TCP acknowledging actions will experience a time delay from the router to the source in a TCP system. In this paper, a time-delay control theory is applied to analyze the mechanism of packet-dropping at router and the window-updating in TCP source in TCP congestion control for a TCP/RED dynamic model. We then derive explicit conditions under which the TCP/RED system is asymptotically stable in terms of the instantaneous queue. We discuss the convergence of the buffer queue lengths in the routers. Our results suggest that, if the network parameters satisfy certain conditions, the TCP/RED system is stable and its queue length can converge to any target. We illustrate the theoretical results using ns2 simulations and demonstrate that the network can achieve good performance and converge to the arbitrary target queues.     

V2G网络中基于带宽自适应的拥塞控制协议优化

V2G网络下PLC链路带宽受限、高误码率等特点导致现有的TCP NewReno拥塞控制机制缺乏对丢包类型的有效判断,将链路上由噪声干扰的随机错误丢包与网络拥塞丢包统一当做拥塞事件处理,从而造成不必要的拥塞避免,导致了低吞吐量问题.根据此问题,提出了一种基于带宽自适应的拥塞控制算法.该算法通过分组预测拥塞等级感知网络状态,由此估计可用带宽来判断丢包类型,实现了拥塞窗口自适应调节.仿真结果表明该算法在拥塞窗口的增长、吞吐量、公平性、收敛性和友好性等方面都优于现有算法,V2 G网络的吞吐量得到明显提升.