PMIMD拥塞控制算法

分析了目前在Internet上占主导地位的AIMD算法，指出了其在保持数据流稳定性上的不足，这一缺点不能适应当前的媒流体文件传输；提出了一种新的算法--PMIMD（比例乘性增加乘性减少）。仿真结果表明，本算法能减少控制的超调量，从而降低传输率的波动。     

Fairness in MIMD Congestion Control Algorithms

The Mulitplicative Increase Multiplicative Decrease (MIMD) congestion control algorithm in the form of Scalable TCP has been proposed for high speed networks. We study fairness among sessions sharing a common bottleneck link, where one or more sessions use the MIMD algorithm. Losses, or congestion signals, occur when the capacity is reached but could also be initiated before that. Both synchronous as well as asynchronous losses are considered. In the asynchronous case, only one session suffers a loss at a loss instant. Two models are then considered to determine which source looses a packet: a rate dependent model in which the packet loss probability of a session is proportional to its rate at the congestion instant, and the independent loss rate model. We first study how two MIMD sessions share the capacity in the presence of general combinations of synchronous and asynchronous losses. We show that, in the presence of rate dependent losses, the capacity is fairly shared whereas rate independent losses provide high unfairness. We then study inter protocol fairness: how the capacity is shared in the presence of synchronous losses among sessions some of which use Additive Increase Multiplicative Decrease (AIMD) protocols whereas the others use MIMD protocols.     

Stability Analysis of Explicit Congestion Control Protocols

In the context of explicit congestion control protocols like XCP and RCP where the equilibrium queue lengths are zero, we show that the stability region derived from traditional Nyquist analysis is not an accurate representation of the actual stability region, and that the use of switched linear system models with time delay and new Lyapunov tools can provide sound sufficient stability conditions.     

Delay-Independent Stability and Performance of Distributed Congestion Control

Recent research efforts to design better Internet transport protocols combined with scalable active queue management (AQM) have led to significant advances in congestion control. One of the hottest topics in this area is the design of discrete congestion control algorithms that are asymptotically stable under heterogeneous feedback delay and whose control equations do not explicitly depend on the RTTs of end-flows. In this paper, we first prove that single-link congestion control methods with a stable radial Jacobian remain stable under arbitrary feedback delay (including heterogeneous directional delays) and that the stability condition of such methods does not involve any of the delays. We then extend this result to generic networks with fixed consistent bottleneck assignments and max-min network feedback. To demonstrate the practicality of the obtained result, we change the original controller in Kelly's work [ldquoRate Control for communication networks: Shadow prices, proportional fairness and stability,rdquo Journal of the Operational Research Society, vol. 49, no. 3, pp. 237-252, March 1998] to become robust under random feedback delay and fixed constants of the control equation. We call the resulting framework max-min Kelly control (MKC) and show that it offers smooth sending rate, exponential convergence to efficiency, and fast convergence to fairness, all of which make it appealing for future high-speed networks.     

Analysis of Packet Network Congestion Control Using Sparse Matrix Algorithms

The purpose of this study is twofold. First the study illustrates the utility of applying sparse matrix methods to packet network models. Secondly, these methods are used to give new results about the control of store and forward congestion in packet networks. Store and forward congestion (node to node blocking) reduces the effective traffic carrying capacity of the network by unnecessarily idling network resources. This study shows how store and forward congestion can be controlled by a combination of buffer reservation and processor capacity allocation. The scheme presented is analyzed using a Markovian state-space model of two coupled packet switches. The model contains more detail than previous analytic models. It is therefore solved using numerical sparse matrix methods. The results show that the combination of buffer reservation and processor capacity allocation gives strictly nondecreasing network output as a function of increasing network input load, i.e., undesirable store and forward congestion effects are eliminated.     

Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet

We consider the problem of congestion-aware multi-path routing in the Internet. Currently, Internet routing protocols select only a single path between a source and a destination. However, due to many policy routing decisions, single-path routing may limit the achievable throughput. In this paper, we envision a scenario where multi-path routing is enabled in the Internet to take advantage of path diversity. Using minimal congestion feedback signals from the routers, we present a class of algorithms that can be implemented at the sources to stably and optimally split the flow between each source-destination pair. We then show that the connection-level throughput region of such multi-path routing/congestion control algorithms can be larger than that of a single-path congestion control scheme     

TCP-Shape:一种改进的网络拥塞控制算法研究

网络拥塞是由于网络业务流不可预测的流量突发现象造成的.文章从考虑网络业务流突发现象产生的特点出发,采用可用带宽测量技术和流量整形技术,提出了一种针对传统网络拥塞控制算法的改进算法(TCP-Shape).改进后的拥塞控制算法能够快速地探测到网络链路中可用剩余带宽并能够有效地消除网络业务流中的突发现象.使得在网络业务流的吞吐量和数据报文段的丢失率等性能上,更加优越于传统拥塞控制算法所获得的性能.     

IP网络中TCP拥塞控制协议的稳定性分析

文章用泛函微分方程建立了TCP拥塞控制协议的动态模型,通过该模型分析了当前Internet上使用的TCP拥塞控制算法,导出了稳定性条件,结果表明该算法在一定网络环境下是不稳定的.     

Multipath Routing Algorithms for Congestion Minimization

Unlike traditional routing schemes that route all traffic along a single path, multipath routing strategies split the traffic among several paths in order to ease congestion. It has been widely recognized that multipath routing can be fundamentally more efficient than the traditional approach of routing along single paths. Yet, in contrast to the single-path routing approach, most studies in the context of multipath routing focused on heuristic methods. We demonstrate the significant advantage of optimal (or near optimal) solutions. Hence, we investigate multipath routing adopting a rigorous (theoretical) approach. We formalize problems that incorporate two major requirements of multipath routing. Then, we establish the intractability of these problems in terms of computational complexity. Finally, we establish efficient solutions with proven performance guarantees     

多路径传输控制协议技术综述

随着互联网的应用发展,用户对带宽的需求日益增大。同时,伴随着宽带接入技术的发展,终端可以同时具有多条网络链接,然而传统传输控制协议(TCP)采取单路通信,因而造成资源浪费。为此,IETF专门提出了多路径TCP(MPTCP)来实现TCP的多路传输,从而提高链路利用率和协议鲁棒性。本文对国内外MPTCP的最新研究成果进行了总结,包括MPTCP的体系结构、路由和拥塞控制等内容,可为国内研究者进一步深入研究提供参考。     

基于Lyapunov稳定理论的有源噪声控制算法研究

在有源噪声控制中引入基于Lyapunov稳定理论的目标函数,给出了应用于有源噪声控制的约束条件,推导出应用于有源噪声控制的单通道和多通道的Lyapunov稳定算法。通过计算机仿真证实新算法的性能要优于FXLMS算法。     

无线网络拥塞控制中流体流模型的Hopf分岔及其稳定性

该文对一个用于无线网络拥塞控制算法设计的具有通信时延的流体流模型进行Hopf分岔分析,以通信时延作为分岔参数,证明此模型Hopf分岔的存在性,并应用中心流形和规范型理论推导出确定 Hopf 分岔方向和分岔周期解稳定性的计算公式,数值仿真验证了结论的有效性。     

WCDMA拥塞控制方法分析

网络拥塞和过载直接影响到3G网络的性能和服务质量.本文阐述了WCDMA网络中的拥塞控制原理,并针对几种重要的拥塞控制方法分别进行了分析.最后,针对维护优化中可能出现的问题,提出了建议和解决思路.     

通信网络中的拥塞控制

介绍了网络中发生拥塞带来的问题,TCP／IP的拥塞控制和常用的减少拥塞的几种措施;讨论了拥塞管理的算法并介绍了2种拥塞避免的算法,即随机早期检测(RED)算法和加权随机早期检测(WRED)算法;说明了参数选择的依据,并简单描述了在大型TCP／IP网络中运用WRED算法的意义。     

B－ISDN中的拥塞控制技术

Ｂ－ＩＳＤＮ是现代电信网的发展方向，拥塞控制技术则是其中的一个重要问题。由于Ｂ－ＩＳＤＮ采用新的信息传递方式──ＡＴＭ，使传统的拥塞控制方法不再适用。本文依据ＩＴＵ－Ｔ有关建议的最新内容对Ｂ－ＩＳＤＮ拥塞控制的基本思想、工作机制以及其中的主要功能作了较为详细的分析讨论，并提出了一些Ｂ－ＩＳＤＮ拥塞控制技术中尚需进一步研究的问题。     

Efficient Multicast Congestion Control

Now day’s computer network is an essential part of our life. Day by day, there is a high increment in the uses of computer network applications such email, bloggers, internet group, forums, conference, youtube and online TV. The exponential increment in video applications traffic, there increases challenges of computer network and it faces various problems like shortage of memory, link failure, slow processor, time out etc. These problems may lead to network congestion. Multicast is efficient system which handles the video traffic but it also suffers with congestion problem due to design vulnerability. Many researchers are working in this burning issue and they provided various solutions such as source based, receiver based and hybrid one. In this paper, we propose an efficient multicast congestion control approach which suggests the efficient joining, leaving operation based on adaptive throughput. The simulated results show that proposed scheme provides better throughput at various parameters.     

TCP拥塞控制的公平性研究

针对目前Internet中TCP拥塞控制和式增加、积式减小和窗口变化机制,分析了TCP流量控制带宽分配的公平性问题。     

Limitations of Equation-Based Congestion Control

We study limitations of an equation-based congestion control protocol, called TCP-friendly rate control (TFRC). It examines how the three main factors that determine TFRC throughput, namely, the TCP-friendly equation, loss event rate estimation, and delay estimation, can influence the long-term throughput imbalance between TFRC and TCP. Especially, we show that different sending rates of competing flows cause these flows to experience different loss event rates. There are several fundamental reasons why TFRC and TCP flows have different average sending rates, from the first place. Earlier work shows that the convexity of the TCP-friendly equation used in TFRC causes the sending rate difference. We report two additional reasons in this paper: 1) the convexity of where is a loss event period and 2) different retransmission timeout period (RTO) estimations of TCP and TFRC. These factors can be the reasons for TCP and TFRC to experience initially different sending rates. But we find that the loss event rate difference due to the differing sending rates greatly amplifies the initial throughput difference; in some extreme cases, TFRC uses around 20 times more, or sometimes 10 times less, bandwidth than TCP. Despite these factors influencing the throughput difference, we also find that simple heuristics can greatly mitigate the problem.     

Joint Congestion Control, Routing, and MAC for Stability and Fairness in Wireless Networks

In this paper, we describe and analyze a joint scheduling, routing and congestion control mechanism for wireless networks, that asymptotically guarantees stability of the buffers and fair allocation of the network resources. The queue-lengths serve as common information to different layers of the network protocol stack. Our main contribution is to prove the asymptotic optimality of a primal-dual congestion controller, which is known to model different versions of transmission control protocol well.