Generalized multicast congestion control

Efficient multicast congestion control (MCC) is one of the critical components required to enable the IP multicast deployment over the Internet. Previously proposed MCC schemes can be categorized in two: single-rate or multi-rate. Single-rate schemes make all recipients get data at a common rate allowed by the slowest receiver, but are relatively simple. Multi-rate schemes allow of heterogeneous receive rates and thus provide better scalability, but rely heavily on frequent updates to group membership state in the routers. A recent work by Kwon and Byers, combined these two methods and provided a multi-rate scheme by means of single-rate schemes with relatively low complexity.In this paper, we propose a new scheme called generalized multicast congestion control (GMCC). GMCC provides multi-rate features at low complexity by using a set of independent single-rate sub-sessions (a.k.a layers) as building blocks. The scheme is named GMCC because single-rate MCC is just one of its special cases. Unlike the earlier work by Kwon and Byers, GMCC does not have the drawback of static configuration of the source which may not match with the dynamic network situations. GMCC is fully adaptive in that (i) it does not statically set a particular range for the sending rates of layers, and (ii) it eliminates redundant layers when they are not needed. Receivers can subscribe to different subsets of the available layers and hence can always obtain different throughput. While no redundant layers are used, GMCC allows receivers to activate a new layer in case existing layers do not accommodate the needs of the actual receivers.     

Extending TCP congestion control to multicast

This paper proposes a new single-rate multicast congestion control scheme named PGMTCC, which has been implemented and investigated in PGM. The primary idea of PGMTCC is to extend Sack TCP congestion control mechanism to multicast in order to make multicast perform almost the same as Sack TCP under all kinds of network conditions. To achieve this goal, first of all, the sender should accurately select a receiver with the worst throughput as a representative (acker) by a simplified equation of TCP throughput. Then the Sack TCP congestion control mechanism, with some modifications to be adapted to multicast, is deployed to take charge of congestion control between the sender and the acker. Moreover, in our scheme, the problem of the feedback suppression is considered and solved by a selective suppression mechanism of feedback. NS2 is used to test and investigate the performance of our scheme. As expected, PGMTCC performs almost like Sack TCP under all kinds of conditions. We believe that it is TCP-friendly, robust and scalable.     

基于种群生态的组播拥塞控制机制

针对现有TCP类组播拥塞控制机制不具有速率平滑性、往返时间(RTT)公平性以及在高速环境中传输效率低的问题,提出一种基于种群生态理论的自适应高速组播拥塞控制机制。该机制在每个接收端实现瓶颈链路带宽和背景流速率的测量,并将这两个测量值用于种群生态模型中以计算期望服务速率,然后使用一种简单的反馈抑制机制选取期望服务速率最小的接收端作为代表,该代表将其期望服务速率反馈给源端控制发送速率。仿真结果表明新机制发送速率平滑,具有RTT公平性,在低速网络和高速网络中都能与单播流公平共享带宽资源。     

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

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

一种路由器辅助的多速率组播拥塞控制策略

IP组播是一种有效的数据传输方式,由于其自身特性决定了在组播中实现可靠性和拥塞控制非常困难,因此设计合适的拥塞控制协议是一个迫切需要解决的问题,而这一点仅依赖于端系统控制拥塞的能力是有限的,文中尝试将一种主动队列管理(AQM)算法REM加入到多速率组播拥塞控制协议RLC当中,使网络本身参与对拥塞的监测和预防,并通过利用REM提供的拥塞指示(CI)对现有多速率组播解决办法在接收者加入层或者离开层的行为策略上进行改进。     

一种改进的多速率组播拥塞控制协议DAMCC

提出了一种新的动态分配带宽的多速率组播拥塞控制策略(DAMCC).针对当前使用的多速率组播拥塞控制策略RLC调整速率粒度粗糙、接收端带宽的利用不充分的问题,DAMCC设计了动态分段计算增强层的速率算法.执行DAMCC的接收端,根据反馈的响应信息计算网络往返延迟(RTT),进而计算自身的TCP友好速率,以相应的速率接收组播数据,达到与TCP流公平竞争网络资源的目的.仿真实验表明,该拥塞控制策略比分层组播控制常用的典型策略(RLC)更有效地利用网络带宽,解决网络带宽的异构性问题,并能通过接收端计算TCP友好速率,使接收端达到与TCP流公平竞争网络资源的目的.     

MTCP: scalable TCP-like congestion control for reliable multicast

We present MTCP, a congestion control scheme for large-scale reliable multicast. Congestion control for reliable multicast is important, because of its wide applications in multimedia and collaborative computing, yet non-trivial, because of the potentially large number of receivers involved. Many schemes have been proposed to handle the recovery of lost packets in a scalable manner, but there is little work on the design and implementation of congestion control schemes for reliable multicast. We propose new techniques that can effectively handle instances of congestion occurring simultaneously at various parts of a multicast tree.Our protocol incorporates several novel features: (1) hierarchical congestion status reports that distribute the load of processing feedback from all receivers across the multicast group, (2) the relative time delay concept which overcomes the difficulty of estimating round-trip times in tree-based multicast environments, (3) window-based control that prevents the sender from transmitting faster than packets leave the bottleneck link on the multicast path through which the sender's traffic flows, (4) a retransmission window that regulates the flow of repair packets to prevent local recovery from causing congestion, and (5) a selective acknowledgment scheme that prevents independent (i.e., non-congestion-related) packet loss from reducing the sender's transmission rate. We have implemented MTCP both on UDP in SunOS 5.6 and on the simulator ns, and we have conducted extensive Internet experiments and simulation to test the scalability and inter-fairness properties of the protocol. The encouraging results we have obtained support our confidence that TCP-like congestion control for large-scale reliable multicast is within our grasp.     

A novel loss indication filtering approach for multicast congestion control

A key issue in the design of source-based multicast congestion control schemes is how to aggregate loss indications from multiple receivers into a single rate control decision at the source. Such aggregation entails filtering out a portion of the loss indications received by the source, and then using the remaining for rate adjustments. In this paper, we first propose a set of goals guiding the design of loss indication filters. We then present a novel loss indication filtering approach, the linear proportional response (LPR) approach. Analysis and simulation is used to compare LPR to two well-known approaches — the random listening algorithm (RLA) [Proceedings of ACM SIGCOMM (1998)] and the worst estimate-based tracking (WET) [Proceedings of IEEE Infocom (1999)] approach. Our results indicate that LPR achieves a desirable tradeoff between stability and response, thereby making it more suitable than WET and RLA for deployment in an Internet-like environment.     

基于TCP拥塞控制可靠性多播协议的研究

随着互联网规模的增长,互联网上的用户和应用都在快速的增长,拥塞已经成为一个十分重要的问题.由此提出了一个新的协议,称为可靠的拥塞控制多播协议(RCCMP).拥塞控制是该协议的核心,该协议即不需要来自于网络元素的支持,也不需要维持依靠接收者数目的状态信息,并在此研究的基础上也介绍了该协议执行性能的系列仿真结果.     

模糊随机早期检测在组播拥塞控制中的应用

现有的组播拥塞控制算法大都基于端系统进行拥塞控制,而较少讨论中间路由器的主动队列管理机制。基于模糊逻辑对网络状态的动态适应性特点,提出了基于模糊逻辑的RED算法（Fuzzy Logic-based RED,FL RED）。该算法运用于组播拥塞控制中,网络能够及时对拥塞做出准确反应,更有效地分配和利用资源。仿真结果表明,该算法比普通RED算法具有更好的TCP-友好性,并且能够将队列长度维持在一个较小值,具有更小的传输时延。     

主动网络拥塞控制研究与实现

随着Internet的迅速发展,网络流量急剧增长,网络的拥塞问题日益突出,阐述了拥塞产生的原因,介绍了主动网络的思想和体系结构,着重探讨了主动网络在拥塞控制和网络管理等方面的应用,描述了主动拥塞控制系统中主动节点的内部结构,提出了主动拥塞控制系统的一种实现.实验结果显示,实行主动拥塞控制的网络比实行传统拥塞控制的网络在性能上有了一定程度的提高.     

灰色预测PI主动队列管理拥塞控制策略

提出了一种新颖的基于隐含类型的GM模型的预测PI算法。利用预测队列误差而非瞬时采样值来决定路由器的丢包率。该方法致力于在响应速度与增益两者之间取得一个最佳的折中。仿真结果验证了该灰色预测PI主动队列管理策略的有效性。     

Generic congestion control

The nowadays Internet architecture is mainly based on unicast communications and best-effort service. However, the development of the Internet encouraged emerging services that are sensitive to delay or packet loss, as it is the case for multimedia and group applications. The deployment of these applications should not compromise the proper transmission of TCP flows and would benefit significantly from flows that are responsive to congestion.We propose efficient congestion avoidance mechanism (ECAM)¹ as a generic framework for congestion control in the Internet, to address this lack and important need of congestion control in various situations that occurs in the Internet. ECAM is designed for uncontrolled unicast and multicast traffic and supports both reliable and unreliable best-effort flows. ECAM works not only for best-effort service, but supports as well the new differentiated services, where out of profile packets may experience congestion. Implementation problems are also discussed.     

基于智能预测控制的网络拥塞主动队列管理算法研究

路由队列管理是保证网络性能、避免网络拥塞的重要手段,目前采用的主要队列管理方法为被动式队列管理,同时主动式队列管理已经成为近来的主要研究热点. 随机早侦测(RED)作为最早提出的主动队列管理方法,更获得了普遍的关注. 使用严格的数学模型来描述由端系统和网关组成的系统,并进行队列管理性能分析. 提出一种采用快速广义预测控制的RED控制器( FGPC2RED控制器) ,进行网络拥塞控制的研究. 介绍了系统的结构及系统的辨识, 并通过仿真证明了FGPC算法在路由队列管理中应用的可行性,可以有效控制队列长度,避免路由拥塞及减小往返延迟.     

TCP拥塞控制算法

针对广泛应用的TCP Reno慢启动算法与拥塞避免算法的问题,在研究分析TCP Reno拥塞控制算法的基础上,提出一种新的拥塞控制算法——在慢启动阶段采用线性增长算法,而在拥塞避免阶段采用基于拥塞窗口的对数增长算法,从而一定程度上解决了TCPReno慢启动不公平问题与拥塞避免阶段拥塞窗口增长过于激进的问题。通过NS仿真实验说明了新算法的可行性,并对其吞吐量、公平性、友好性进行评估,仿真结果表明了该改进的TCP拥塞控制算法的有效性。     

一种主动TCP拥塞控制方案*

基于广泛使用的TCP版本TCP Reno,提出了一种主动TCP拥塞控制方案,命名Active-TCP。在沿用传统的被动拥塞控制方式的同时,Active-TCP添加了主动拥塞控制方式,即在满足给定条件下,Active-TCP可主动降低拥塞窗口,而此时网络并未真正发生拥塞。仿真分析了Active-TCP性能,结果表明,与TCP Reno相比,使用Active-TCP可改善吞吐量,降低报文重传率;Active-TCP也能与TCP Reno友好共存,公平竞争网络资源。另外,Active-TCP可由TCP Reno     

一种改进的拥塞控制算法

为控制网络拥塞,提出一种改进的随机早期检测（RED)算法——基于加权和的随机早期检测（WHS-RED）算法。算法的基本思想是利用网络中队列长度及其变化率的加权和,动态地控制网络丢包率。建立了数学模型,并给出了计算机仿真分析结果。实验证明改进算法减小了网络丢包率和带宽延迟,在维持网络稳定性和减小队列的波动性方面优于原RED算法。     

Loss-resilient window-based congestion control

This paper addresses the problem of fair allocation of bandwidth resources on lossy channels in hybrid heterogeneous networks. It discusses more particularly the ability of window-based congestion control to support non-congestion related losses. We investigate methods for efficient packet loss recovery by retransmission, and build on explicit congestion control mechanisms to decouple the packet loss detection from the congestion feedback signals. For different retransmission strategies that respectively rely on conventional cumulative acknowledgments or accurate loss monitoring, we show how the principles underlying the TCP retransmission mechanisms have to be adapted in order to take advantage of an explicit congestion feedback. A novel retransmission timer is proposed in order to deal with multiple losses of data segments and, in consequence, to allow for aggressive reset of the connection recovery timer. It ensures significant benefit from temporary inflation of the send-out window, and hence the fair share of bottleneck bandwidth between loss-prone and lossy connections. Extensive simulations analyze the performance of the new loss monitoring and recovery strategies, when used with two distinct explicit congestion control mechanisms. The first one relies on a coarse binary congestion notification from the routers. The second one, introduced in [D. Katabi, M. Handley, C. Rohrs, Internet congestion control for high bandwidth-delay product environments, ACM SIGCOMM (2002) 89–102], exploits accurate and finely-tuned router feedbacks to compute a precise congestion window adjustment. For both congestion control mechanisms, we observe that retransmissions triggered based on a precise monitoring of losses lead to efficient utilization of lossy links, and provide a fair share of the bottleneck bandwidth between heterogeneous connections, even for high loss ratios and bursty loss processes. Explicit window-based congestion control, combined with appropriate error control strategies, can therefore provide a valid solution to reliable and controlled connections over lossy network infrastructures.