基于AIMD算法的分层多播拥塞控制

提出了一种基于AIMD算法的分层多播拥塞控制算法．算法借助AIMD算法具有的良好TCP兼容性和稳定性，采用慢增慢减的速率调节原则来防止TCP中速率减半策略所带来的速率振荡．为避免反馈处理带来的复杂性和可扩缩性问题，提出了无须反馈的收方至发方间往返时延估计方法．算法采用类似TCP的慢启动算法来提高链路的利用率和收敛速度．通过仿真评估得出，算法对TCP流、不同多播流均表现出理想的公平性，并有很高的带宽利用率和良好的稳定性．     

An ergodic AIMD algorithm with application to high-speed networks

In this article we propose a version of the Additive-Increase Multiplicative-Decrease (AIMD) algorithm that provides a suitable basis to develop congestion control protocols that can be deployed in both conventional and high-speed communication networks. Our algorithm retains many of the properties of the standard AIMD algorithm. However, unlike other non-standard AIMD algorithms, our scheme can be shown to be ergodic under very general assumptions.     

用于Ad Hoc网络的自适应多速率多播拥塞控制策略

多播提高了链路的传输效率,但易于造成网络拥塞.因此,在网络中实施多播拥塞控制至关重要.然而,由于AdHoc网络的两个本质特点,为Internet设计的多播拥塞控制不适合AdHoc网络:(1)无线多跳连接引起了信息流之间在时间域和空间域的竞争;(2)节点频繁移动导致了网络状态不断变化.首先提出了链路干扰集的概念来描述信息流竞争的特点,将网络状态不变的小时间段内的多速率多播拥塞控制问题表达成一个非线性优化问题,联合运用罚函数法和次梯度法获得此问题的优化解,相应地提出了一种有效的分布式迭代算法.在此算法基础上,针对网络状态的时变性,设计了一种基于状态检测和滚动优化的自适应多速率多播拥塞控制策略——AC2M2.仿真结果表明,分布式算法能够快速收敛到最优解;AC2M2(adaptive congestion control strategy for multirate multicast sessions)策略对网络状态的变化具有较好的自适应能力,所获得的网络性能比TCP-Reno要优越得多.     

基于观测器的网络拥塞控制算法

针对动态网络的拥塞问题,设计一种基于观测器的鲁棒主动队列管理控制算法。该算法保证输入受限情况下时变时滞不确定网络系统的渐近稳定。通过Lyapunov稳定性分析,利用线性矩阵不等式技术研究基于观测器的鲁棒控制器的存在条件以及设计方法。仿真结果表明,该算法可以使路由器中的队列长度快速收敛到目标值,同时保持较小的队列振荡。特别在网络条件变化及出现突发流的情况下,该控制器仍能具有良好的鲁棒特性。     

Bounds estimation and practical stability of AIMD/RED systems with time delays

The Additive Increase and Multiplicative Decrease (AIMD) congestion control algorithm of TCP deployed in the end systems and the Random Early Detection (RED) queue management scheme deployed in the intermediate systems contribute to Internet stability and integrity. Previous research based on the fluid-flow model analysis indicated that, with feedback delays, the TCP/RED system may not be asymptotically stable when the time delays or the bottleneck link capacity becomes large [3]. However, as long as the system operates near its desired equilibrium, small oscillations around the equilibrium are acceptable, and the network performance (in terms of efficiency, loss rate, and delay) is still satisfactory. In this paper, we study the practical stability of AIMD/RED system with feedback delays and with both homogeneous and heterogeneous flows. We obtain theoretical bounds of the flow window size and the RED queue length, as functions of the number of flows, link capacity, RED queue parameters, and AIMD parameters. Numerical results with Matlab and simulation results with NS-2 are given to validate the correctness and demonstrate the tightness of the derived bounds. The analytical and simulation results provide important insights on which system parameters contribute to higher system oscillations and how to set parameters (such as buffer size and queue management parameters) to ensure system efficiency with bounded delay and loss. Our results can also help to predict and control the system performance for Internet with higher data rate links multiplexed with heterogeneous flows with different parameters.     

A robust fractional-order PID controller design based on active queue management for TCP network

In this paper, a robust fractional-order controller is designed to control the congestion in transmission control protocol (TCP) networks with time-varying parameters. Fractional controllers can increase the stability and robustness. Regardless of advantages of fractional controllers, they are still not common in congestion control in TCP networks. The network parameters are time-varying, so the robust stability is important in congestion controller design. Therefore, we focused on the robust controller design. The fractional PID controller is developed based on active queue management (AQM). D-partition technique is used. The most important property of designed controller is the robustness to the time-varying parameters of the TCP network. The vertex quasi-polynomials of the closed-loop characteristic equation are obtained, and the stability boundaries are calculated for each vertex quasi-polynomial. The intersection of all stability regions is insensitive to network parameter variations, and results in robust stability of TCP/AQM system. NS-2 simulations show that the proposed algorithm provides a stable queue length. Moreover, simulations show smaller oscillations of the queue length and less packet drop probability for FPID compared to PI and PID controllers. We can conclude from NS-2 simulations that the average packet loss probability variations are negligible when the network parameters change.     

TCP Yuelu:一种基于有线/无线混合网络端到端的拥塞控制机制

无线链路传输数据的比特率出错导致TCP协议在有线／无线混合网络环境下性能低下,在改进算法TCPReno的基础上,文章提出了一种适用于有线／无线混合网络的拥塞控制机制,该机制包括一种分阶段平滑慢启动机制,改善了突发流量对网络性能的损害,引入网络测量技术获得了往返时间（RTT）、网络带宽、瓶颈链路队列长度等网络状态参数,区分网络拥塞和无线链路比特差错,避免了终端节点对网络状态不了解产生的盲目行为,有效改进了TCP的加性增加乘性减少（AIMD）窗口调节机制,提高了网络性能．同时,在仿真软件NS2中实现了该算法,进行了大量的仿真实验,实验结果表明TCP Yuelu有效降低了网络抖动,提高了网络传输性能,并保持了良好的公平性和对其它TCP流的友好性．     

一种TCP友好的多媒体流分层组播拥塞控制算法

针对当前多媒体流分层组播拥塞控制方案的不足,提出一种改进的接收者驱动的分层组播拥塞控制算法,并给出了详细的设计方案。算法借助AIMD算法具有的良好TCP兼容性保证组播流与TCP流的友好性;利用基于历史记录动态调整接收端加入某层等待时间的策略解决因过多失败的“加入”尝试带来的网络拥塞和振荡问题。通过实验证实了算法的有效性。     

Adaptive AIMD Congestion Control

The main objectives of a congestion control algorithm are high bandwidth utilization, fairness and responsiveness in a changing environment. However, these objectives are contradicting in particular situations since the algorithm constantly has to probe available bandwidth, which may affect its stability. This paper proposes a novel congestion control algorithm that achieves high bandwidth utilization providing fairness among competing connections and, on the other hand, is sufficiently responsive to changes of available bandwidth. The main idea of the algorithm is to use adaptive setting for the additive increase/multiplicative decrease (AIMD) congestion control scheme, where parameters may change dynamically, with respect to the current network conditions.     

Distributed resource management with heterogeneous linear controls

Relative differentiation in distributed resource sharing can be implemented using heterogeneous linear controls with binary feedback and this method can provide efficient and weighted max–min fair resource allocations. We prove this using a discrete-time model of a single resource, shared among a number of users with heterogeneous Additive Increase Multiplicative Decrease (AIMD) controls. AIMD has been implemented in the congestion avoidance mechanism of Internet's Transmission Control Protocol (TCP) and beyond its simplicity it has been proved extremely efficient and robust. We show how AIMD can be parametrized in order to allow the scaling of user allocations according to a given set of weights. We also analyze the effects of different parameter choices on the performance and the oscillating behaviour of the system. Our analysis is supported by simulations and the results provide useful insights to the performance and the properties of distributed resource sharing.     

Analysis and design of AIMD congestion control algorithms in communication networks

We present a model of a network of synchronised sources operating additive increase multiplicative decrease (AIMD) congestion control algorithms. We show: (i) that networks of such devices in the presence of a drop-tail bottleneck buffer may be modelled as a positive linear system; (ii) that such networks possess a unique stationary point; and (iii) that this stationary point is globally exponentially stable. We use these results to establish conditions for the fair co-existence of traffic in networks employing heterogeneous AIMD algorithms and to design a new protocol for operation over high-speed and long-distance links.     

异构网络中基于MPTCP的协作拥塞控制方案

提出了一种基于MPTCP的协作拥塞控制方案。在拥塞避免阶段,该方案首次以马尔科夫链模型为基础,对异构网络中各条路径上未被确认的数据包个数进行预测,进而计算出各条路径所能承载的最大数据量。若网络拥塞窗口值大于各条路径所能承载的最大数据量中最小值的2倍,则启动协作拥塞控制机制。在协作拥塞控制机制下,根据AIMD算法的加性增加准则调整拥塞窗口,若网络拥塞窗口值大于各条路径所能承载数据量之和,则结束协作拥塞控制机制,执行传统的TCP慢启动算法。为了提高慢启动阶段的带宽利用率,对TCPW(TCP Westwood)带宽估计算法进行改进,使路径可用带宽的估计更准确,从而提高慢启动阈值设置的合理性。仿真结果表明,在保证异构网络负载均衡及单条TCP流公平性的前提下,该方案能够增加成功传输数据包的数量。     

ABR流量控制中的变结构控制器

自适应比特(available bit rate,简称ABR)业务的流量控制是ATM网络中一种有效的拥塞控制机制和流量管理手段.在高速的ATM网络中,算法的简洁性在很大程度上决定着交换机的性能.尽管二进制ABR流量控制的简洁性具有相当大的吸引力,但标准的EFCI算法控制的队列长度和允许信元速率(allowed cell rate,简称ACR)却容易出现大幅振荡的现象,这势必会降低链路的利用率,严重影响交换机的性能.进而又有了相对复杂却有效的显式速率反馈机制.在此研究中,以已有的ABR流量控制模型为基础,应用概率拥塞判定机制,并借助鲁棒控制理论中滑模变结构控制器的设计方法,为ABR流量控制设计了一种新的二进制算法,避免了标准EFCI算法中非线性环节诱发的自激振荡,这对于充分发挥二进制流控算法的简洁性以及优化交换机的性能是极为有利的.仿真实验表明:二进制流量控制中的滑模变结构算法大幅度地抑制了ACR和队列的振荡,平滑了由此而引入的时延抖动,为实现ATM网络中的服务质量提供了可靠的实现机制.     

APAIMD算法及基于此算法的APTCP协议

本文提出了一种可调参数AIMD算法和一种在接收端实现该算法的适合在Internet上传输多媒体流的可调参数传输控制协议。UDP不适合传输多媒体数据，因为它没有拥塞控制机制。TCP遇到单个数据包丢失传输速率就减半，会造成速率剧烈抖动，也不适合传输多媒体数据。在APTCP控制下传输的多媒体流具有良好的速率平滑性，并能够与竞争的TCP流公平的分享带宽。APTCP便于升级到组播多媒体业务，可用于非对称网络。     

A new congestion control algorithm for improving the performance of a broadcast-based multiprocessor architecture

Congestion occurring in the input queues of broadcast-based multiprocessor architectures can severely limit their overall performance. The existing congestion control algorithms estimate congestion based on a node’s output channel parameters such as the number of free virtual channels or the number of packets waiting at the channel queue. In this paper, we have proposed a new congestion control algorithm to prevent congestion on broadcast-based multiprocessor architectures with multiple input queues. Our algorithm performs congestion control at the packet level and takes into account the next input queue number which will be accessed by the processor, which form the fundamental differences between our algorithm and the algorithms based on the idea of virtual channel congestion control. The performance of the algorithm is evaluated by OPNET Modeler with various synthetic traffic patterns on a 64-node Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus) architecture employing the message passing protocol. Performance measures such as average input waiting time, average network response time and average processor utilization have been collected before and after applying the algorithm. The results show that the proposed algorithm is able to decrease the average input waiting time by 13.99% to 20.39%, average network response time by 8.76% to 20.36% and increase average processor utilization by 1.92% to 6.63%. The performance of the algorithm is compared with that of the other congestion control algorithms and it is observed that our algorithm performs better under all traffic patterns. Also, theoretical analysis of the proposed method is carried out by using queuing networks.     

Stochastic backlog and delay bounds of generic rate-based AIMD congestion control scheme in cognitive radio sensor networks

Performance guarantees for congestion control schemes in cognitive radio sensor networks (CRSNs) can be helpful in order to satisfy the quality of service (QoS) in different applications. Because of the high dynamicity of available bandwidth and network resources in CRSNs, it is more effective to use the stochastic guarantees. In this paper, the stochastic backlog and delay bounds of generic rate-based additive increase and multiplicative decrease (AIMD) congestion control scheme are modeled based on stochastic network calculus (SNC). Particularly, the probabilistic bounds are modeled through moment generating function (MGF)-based SNC with regard to the sending rate distribution of CR source sensors. The proposed stochastic bounds are verified through NS2-based simulations.     

不确定连续模糊系统的鲁棒方差控制

对一类范数有界不确定连续T-S模糊系统,研究了其状态反馈鲁棒方差控制律设计和稳定性问题。利用线性矩阵不等式(LMI)技术,导出了状态反馈鲁棒方差控制律的存在条件和使系统全局渐近稳定的充分条件,并用一组线性矩阵不等式的可行解,给出了使系统全局渐近稳定的状态反馈鲁棒方差控制律的一种参数化表达形式,而这些线性矩阵不等式的解可以用Matlab中LMI工具箱方便地求解。通过对混沌Lorenz系统的仿真,验证了所设计控制器的有效性。     

Congestion-aware channel assignment for multi-channel wireless mesh networks

In this paper, we propose a distributed congestion-aware channel assignment (DCACA) algorithm for multi-channel wireless mesh networks (MC–WMNs). The frequency channels are assigned according to the congestion measures which indicate the congestion status at each link. Depending on the selected congestion measure (e.g., queueing delay, packet loss probability, and differential backlog), various design objectives can be achieved. Our proposed distributed algorithm is simple to implement as it only requires each node to perform a local search. Unlike most of the previous channel assignment schemes, our proposed algorithm assigns not only the non-overlapped (i.e., orthogonal) frequency channels, but also the partially-overlapped channels. In this regard, we introduce the channel overlapping and mutual interference matrices which model the frequency overlapping among different channels. Simulation results show that in the presence of elastic traffic (e.g., TCP Vegas or TCP Reno) sources, our proposed DCACA algorithm increases the aggregate throughput and also decreases the average packet round-trip compared with the previously proposed Load-Aware channel assignment algorithm. Furthermore, in a congested IEEE 802.11b network setting, compared with the use of three non-overlapped channels, the aggregate network throughput can further be increased by 25% and the average round-trip time can be reduced by more than one half when all the 11 partially-overlapped channels are used.     

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

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