基于自适应加权平均的TCP友好拥塞控制机制

TCP友好拥塞控制是保证实时媒体流和组播业务在Internet广泛应用的关键技术.基于收端TCP模拟方案TEAR(TCP emulation at receivers),提出了一个根据丢包类型和当前拥塞周期的持续时间动态调整加权平均参数的拥塞控制机制,称为自适应TCP友好拥塞控制方案ATFCC(adaptive TCP-Friendly congestion control).仿真结果表明,ATFCC方案在速率平滑程度和TCP友好性方面的性能优于TCP友好速率控制协议TFRC(TCP-Friendly rate control).     

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

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

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

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

基于逐段约束的组播拥塞控制机制研究

提出了一种基于逐段随机早期检测（RED）的网络层组播拥塞控制机制STSR,并对其有效性进行了数学推证,证明了STSR组播拥塞控制将具有更高的敏感度,组播传输链路也将具有更高的吞吐量。利用NS 2对STSR拥塞控制进行了模拟,结果证明它能保证对TCP流的友好,并实现了较粗粒度下的分布式控制。STSR在提高网络层组播健壮性的同时,最大限度地保证了其服务效率与质量。     

基于DiffServ的分层组播拥塞控制机制

nternet多媒体业务的发展使得网络异构性问题更加突出,它对传统组播拥塞控制提出了新的要求,分层组播是适应网络异构性的一种有效方案.为了克服传统分层组播质量不稳定、控制复杂、纽播树变动频繁等问题,提出了一种基于区分服务的分层组播拥塞控制机制LMCC.它在考虑预约带宽公平性的前提下进行分组标记和转发,适应了网络异构性.算法性能分析表明LMCC机制具有较快的拥塞响应速度、较好的稳定性、TCP友好性和较低的丢报率.     

组播拥塞控制综述

在组播获得广泛应用之前,必须解决拥塞控制问题.组播拥塞控制有两个重要的评价目标:可扩展性和TCP友好(TCP-friendly).围绕这两个评价目标,介绍组播拥塞控制的研究现状,从不同角度对组播拥塞控制算法进行分析,并讨论最近的组播拥塞控制协议,最后指出今后的研究方向.     

基于逐段RED的组播拥塞控制机制研究

提出了一种基于逐段RED的网络层组播拥塞控制机制,并对其有效性进行了数学推证,证明了信息包在不同优先级的转发约束下,STSR拥塞控制模型的缓冲区共享策略发生拥塞的概率小于分用策略,且STSR具有更高的敏感度和更大的网络吞吐量。利用NS-2对STSR拥塞控制进行了模拟,证明了STSR能保证对TCP流的友好,并实现了较粗粒度下的分布式控制。这一结果的取得对于组播拥塞控制的相关研究具有很大的指导意义。     

无线接入网络中组播拥塞控制机制的研究

随着无线技术的迅速发展和无线设备的日益普及,如何有效地提高传统的组播拥塞控制机制在无线网络中的性能是一个急需解决的课题。本文提出了一种新的组播拥塞控制机制,该机制通过对无线缝路上的随机丢失分组和网络中的拥塞丢失分组进行辨别并采取相应的处理措施,有效地提高了传统的组播拥塞控制机制在无线网络中的性能,同时保证了在有线网络环境中的TCP友好性。     

基于多令牌桶的组播拥塞控制

IP组播是一种有效的数据传输方式,在过去几年中,组播传输机制已经成为一个活跃的研究领域。但由于其自身特性决定了在组播中实现可靠性和拥塞控制非常困难,组播的拥塞控制问题一直没能得到很好的解决,这成为了其发展的瓶颈,不断增加的UDP数据流恶化了TCP控制拥塞的能力,而且是引起高丢包率的原因之一。文中提出了一种可以对局域网内IP分配固定带宽的扩展令牌桶算法,扩展了令牌桶个数,一个令牌桶控制一个IP,消除了共享带宽的缺点,并通过设计电路,建模仿真结果表明可以对路由器交换节点的组播达到准入控制,防止造成网络拥塞,最大限度保证网络Qos,并且设计的电路占用硬件资源少,能够应用于高速电路当中。     

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

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

Configurable active multicast congestion control

A multicast congestion control and avoidance scheme is indispensable for group-based applications to fairly share and efficiently use network resources with unicast applications and maintain the stability of the Internet. It is difficult for the traditional pure “end-to-end” solution to address both TCP-friendliness and inter-receiver fairness [T. Jiang, M.H. Ammar, E.W. Zegura, Inter-receiver fairness: a novel performance measure for multicast ABR sessions, in: Proceedings of ACM SIGMETRICS’98; T. Jiang, E.W. Zegura, M. Ammar, Inter-receiver fair multicast communication over the Internet, in: Proceedings of NOSSDAV’99] by using only one multicast group. In this paper, we present a novel active multicast congestion control scheme (AMCC). Significantly different from the popular end-to-end congestion control approach, AMCC is a router-assisted window-based hierarchical one. With flexible configuration of parameters and effective use of network resources such as buffers at the active routers, AMCC cannot only behave as a TCP-friendly single-rate congestion control scheme, but also have the benefits of a multi-rate congestion control scheme to achieve inter-receiver fairness by limiting the effect of congestion on a specific link to a small region. In addition, when it is used with reliable multicast applications, AMCC has the special mechanisms to regulate repair packets, which are not specifically addressed by the previous work. We implement and evaluate our protocol in NS2 [http://www.isi.edu/nsnam/ns/].     

一种基于组播路由的拥塞控制改进算法

本文融合了网络层组播与应用层组播以及隧道技术,在可靠组播差错恢复算法的基础上引入拥塞控制,使组播的一些中间接收者充当虚拟组播源,在拥塞发生处进行灵活的速率调节,从而灵活有效地解决异构网络中组播的拥塞控制问题,通过仿真试验对组播拥塞控制算法的评价指标进行有效的验证。     

TCP友好多播拥塞控制算法研究

随着多播应用在因特网上广泛开发，多播拥塞控制变得越来越重要。本文首先讨论了多播拥塞控制的主要任务，分析和比较了现有各种多播拥塞控制算法，指出了其中存在的问题，并提出了一种新的、基于速率的TCP友好多播拥塞控制机制。     

ANLMCC--一种基于主动网的分层多播拥塞控制方案

多媒体多播应用在Internet上的广泛部署对多播拥塞控制提出了要求．分层多播是适应网络异构性较有效的方案．针对现有分层多播大多存在拥塞响应延时大、吞吐率抖动剧烈和不满足TCP友好的问题。提出一种新的基于主动网的分层多播拥塞控制方案(ANLMCC),利用主动网灵活的服务定制能力,采用主动标记分层、优先级分层过滤,以及主动节点间逐跳的交互信令机制,大大改进了分层多播的性能．仿真实验表明,ANLMCC具有较快的拥塞响应速度、较好的稳定性和TCP友好的优点．     

大型动态多播群组的密钥管理和访问控制

随着因特网用户的急剧增加和因特网不断的商业化,多播技术呈现出极为广阔的应用领域.在国际上,多播是一个崭新的学术研究领域,主要的研究成果集中在多播的路由算法、流量控制、拥塞控制和可靠传输上,多播安全领域的研究成果相对较少(尤其是在组通信密钥管理方面).研究了多播安全机制中的组通信密钥管理和访问控制问题.提出了一种基于子组安全控制器的组通信密钥管理和访问控制方案,该安全方案改进并解决了IOLUS系统和WGL方案中存在的若干问题,简化了访问控制策略,达到了预期的设计目标和要求.     

LE-SBCC: Loss-Event Oriented Source-Based Multicast Congestion Control

Congestion control is an important building block of a Quality of Service (QoS) system for multicast-based multimedia services and applications on the World Wide Web. We propose an end-to-end single-rate source-based multicast congestion control scheme (LE-SBCC) for reliable or unreliable multicast transport protocols. It addresses all the pieces of the single-rate multicast congestion control problem including drop-to-zero issues, TCP friendliness and RTT estimation. The scheme design consists of a cascaded set of filters and a rate-based additive-increase multiplicative-decrease (AIMD) module. These filters together transform the multicast tree to appear like a unicast path for the purposes of congestion control. Unlike TCP, the scheme is not self-clocked but acts upon a stream of loss indications (LIs) from receivers. These LIs are filtered to get a stream of loss events (LEs) (S. Floyd et al., in SIGCOMM 2000, Aug. 2000) (at most one per RTT per receiver). This LE stream is further filtered to extract the maximum LEs from any one receiver. Then the scheme effects at most one rate-reduction per round trip time (RTT). A range of results (simulation and experimental) is presented and compared against the mathematical model of the scheme components. Furthermore, we have successfully adapted TFRC (Op. cit) to our scheme, which is important to multimedia services desiring relatively stable rates over short time scales.     

一种流媒体代理多播的拥塞控制模型

应用层多播作为一种新兴的多点数据传输模式,其拥塞控制机制却仍未提出一个成熟有效的方案,这成为了限制其广泛应用的一个瓶颈.提出一种流媒体代理多播系统,数据传输过程中采用基于客户端和基于代理的双层拥塞控制模型,最后实验证明该拥塞控制模型可以使系统充分利用网络带宽,提高了视频服务质量.     

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.