一种改进的分层多播拥塞控制方案

针对分层多播接收者的可用带宽异构性问题,提出了一种自适应动态分层多播拥塞控制算法(ADLM).ADLM自适应地运用最优层输率分配算法来满足接收者的异构性,ADLM可以根据网络情况变化动态地调整分层的数量以及每一分层的层速率.仿真实验表明,该拥塞控制策略比分层组播控制常用的典型策略(RLC)更有效地利用网络带宽,解决网络带宽的异构性问题,同时ADLM是TCP友好的,较好地改进了分层多播拥塞控制的性能.     

一种新的逐跳TCP友好的主动分层多播拥塞控制方案

基于Internet的多媒体多播应用的迅猛发展对多播拥塞控制提出了要求.分层多播是适应网络异构性较有效的方案.针对现有分层多播存在的问题,将主动网技术思想引入到分层多播拥塞控制中,提出了一种逐跳TCP友好的主动分层多播拥塞控制方案(HTLMA),采用主动标记分层、逐跳探测TCP友好可用带宽,以及主动速率控制机制.仿真实验表明,HTLMA方案大大改进了分层多播拥塞控制的性能,具有较快的拥塞响应速度、较好的稳定性和TCP友好特性.     

一种新的多速率多播拥塞控制策略

本文提出了一种新的多速率多播拥塞控制策略,以满足分层多播接收者的可用带宽异构性。这种接收方驱动的拥塞控制策略,能够根据网络情况变化动态地调整分层的数量及层速率,运用最优层速率分配算法来满足接收者的可用带宽异构性,接收者的可用带宽可以用根据TCP友好经验公式计算出。仿真实验表明,该算法在TCP友好性上有良好的性能,同时它可以明显提高系统的吞吐量。     

新的多速率多播拥塞控制方案

提出了一种新的基于数据包束探测(packet-bunch probe)和TCP吞吐量公式的多速率多播拥塞控制方案PTMCC(packet-bunch probe and TCP-formula based multicast congestion control)。这种接收端驱动的拥塞控制,采用数据包束来探测网络的可用带宽,利用TCP吞吐量公式得到TCP友好速率,并采用了新的速率调节算法。仿真实验表明,PTMCC在收敛性、灵敏性以及TCP友好性上具有较好的性能。     

基于主动网络的分层组播机制研究

分层组播是解决组播通信当中底层网络结构异构性,适应网络动态变化的一种最佳解决方案。本论文分析了现有的分层组播技术,介绍了采用主动网进行接收方驱动的分层组播的新方案(RLM-AN)。不同于大多数的分层组播方法的端到端的拥塞控制机制,RLM-AN是分布式的TCP友好的拥塞控制机制。方案中把组播树看成是一组虚拟链路,在每个虚拟链路上进行TCP友好的拥塞控制。通过在网络内部的主动节点处进行拥塞控制,传输系统可以得到更为平滑的和更为TCP友好的吞吐量,以及对网络内部拥塞的快速响应。同时,本论文对RLM-AN在技术细节实现上的若干问题进行了讨论。     

基于主动网络的分层组播机制研究

分层组播是解决组播通信当中底层网络结构异构性，适应网络动态变化的一种最佳解决方案。本论分析了现有的分层组播技术，介绍了采用主动网进行接收方驱动的分层组播的新方案(RLM-AN)。不同于大多数的分层组播方法的端到端的拥塞控制机制，RLM-AN是分布式的TCP友好的拥塞控制机制。方案中把组播树看成是一组虚拟链路，在每个虚拟链路上进行TCP友好的拥塞控制。通过在网络内部的主动节点处进行拥塞控制，传输系统可以得到更为平滑的和更为TCP友好的吞吐量，以及对网络内部拥塞的快速响应。同时，本论对RLM-AN在技术细节实现上的若干问题进行了讨论。     

一种多播拥塞控制中速率的调节机制

本文针对计算机高速互联网中多播流的速率调节问题,在单点对多点的多播流量模型基础上,提出了一种由发送方驱动的单速率多播拥塞控制器的设计方法。并且运用现代控制理论和方法,讨论如何利用基于多播的单速率拥塞控制方法来对多播发送节点的发送速率进行调节,从而使得发送节点的发送速率趋于稳定。对所提出的拥塞控制方案,本文进行了分类仿真,仿真结果显示,控制方案使网络性能表现良好。     

面向GEO卫星网络的多速率多播拥塞控制机制

针对GEO卫星网络带宽时延积较大、拥塞控制机制不完善的问题,提出了一种面向GEO卫星网络的多速率多播拥塞控制机制MMCCM_GEO.首先,在保证接收端请求速率最大化的前提下,将GEO卫星网络中的多速率多播问题转化为非线性优化问题,并采用改进的模拟退火算法对其求解,得到了最优的接收端请求速率.其次,通过采用代理节点实现反馈信息的汇集与丢失数据的恢复,有效地解决了反馈内暴及数据恢复问题.仿真结果表明,与目前GEO卫星网络中典型的多速率多播拥塞控制机制相比,本文的拥塞控制机制有效地提高了数据吞吐量和带宽利用率,降低了GEO卫星网络中的数据传输时延,同时也具备了更好的可扩展性.     

TFRC协议改进

为了对非TCP流进行拥塞控制,使它们与TCP流公平地分享带宽,人们设计了多种对TCP友好(TCP-Friendly)的协议。而TFRC(TCPFriendlyRateControl)协议是其中最重要的一种,它是IETF的提议标准。发送端根据接收端的反馈信息计算合理的发送速率。但如果贪婪接收端提供虚假反馈信息,会使发送端以不合理的高速率发送数据。本文对TFRC协议进行改进,使发送端能检测出虚假反馈信息,并对贪婪接收端进行惩罚。     

一种在接收端实现的TCP-Friendly拥塞控制机制

本文提出了一种基于速率的单播TCP-Friendly拥塞控制算法——RAAR(Rate Adaptation at Receivers)控制机制.RAAR是一种接收端的速率自适应算法,它抛弃了每包反馈机制,采用GAIMD(General Additive Increase Multiplicative Decrease)策略进行拥塞控制,其主要控制操作由接收方完成.本文建立了简化的数学模型对其进行吞吐量的分析,得到在RAAR中用于TCP-Friendly 的GAIMD拥塞控制中α与 β的关系.通过与TFRC及TEAR这两种重要的TCP-Friendly协议进行对比研究发现,RAAR协议在对TCP协议的友好性,协议内的公平性以及速率的平滑性等方面具有更好的综合性能.由于RAAR不需进行每包反馈,且主要功能在接收方实现,因此可方便地将该机制引入多媒体组播传输系统中.     

具有层间冗余链路的应用层组播及其性能分析

本文讨论了应用层组播环境下拥塞对扩展树性能的影响,提出了使用层间冗余链路来增强扩展树稳定性的方法,并且通过提出的统计链路模型和相关度模型,对该方法进行了理论分析和性能评价.数字仿真结果说明了统计链路模型有效地描述了应用层组播环境中发生的拥塞,即使在高拥塞链路概率的情况下,层间冗余链路的方法也能以较小的网络延迟代价,显著地增强扩展树的稳定性.本文提出的统计链路模型也可用来深入了解应用层组播的动态行为,或者设计相应的拥塞控制算法.     

A globally stable adaptive congestion control scheme for Internet-style networks with delay

In this paper, we develop, analyze and implement a congestion control scheme in a noncooperative game framework, where each user's cost function is composed of a pricing function proportional to the queueing delay experienced by the user, and a fairly general utility function which captures the user demand for bandwidth. Using a network model based on fluid approximations and through a realistic modeling of queues, we establish the existence of a unique equilibrium as well as its global asymptotic stability for a general network topology, where boundary effects are also taken into account. We also provide sufficient conditions for system stability when there is a bottleneck link shared by multiple users experiencing nonnegligible communication delays. In addition, we study an adaptive pricing scheme using hybrid systems concepts. Based on these theoretical foundations, we implement a window-based, end-to-end congestion control scheme, and simulate it in ns-2 network simulator on various network topologies with sizable propagation delays.     

基于流媒体的实时网络传输系统中若干问题研究

流媒体在Internet上的实时传输常因其要求高带宽、低延迟而造成网络拥塞。探讨了基于Internet的实时流媒体中视频流的QoS控制策略,并主要论述了基于速率的网络拥塞控制方法并给出一种视频流编码速率调整算法。这些控制技术应用于终端系统并不需要路由器和网络QoS支持,可以较好地提高视频质量。     

基于显式速率的TCP友好的UDP拥塞控制策略

本文提出了一种基于显式速率的UDP拥塞控制策略：通过源端和网络中的路由器相互配合，使得实时UDP应用能够根据网络的反馈以瓶颈链路的公平带宽为速率发送数据。此种控制策略对TCP应用是友好的，并且提高了网络的吞吐量和利用率。仿真结果表明：基于显式速率的UDP拥塞控制策略与采用TFRC(TCP—Friendly Rate Control)的UDP拥塞控制策略相比，在吞吐量、TCP友好性等方面性能有较大提高。     

Corruption‐aware adaptive increase and adaptive decrease algorithm for TCP error and congestion controls in wireless networks

The conventional TCP tends to suffer from performance degradation due to packet corruptions in the wireless lossy channels, since any corruption event is regarded as an indication of network congestion. This paper proposes a TCP error and congestion control scheme using corruption‐aware adaptive increase and adaptive decrease algorithm to improve TCP performance over wireless networks. In the proposed scheme, the available network bandwidth is estimated based on the amount of the received integral data as well as the received corrupted data. The slow start threshold is updated only when a lost but not corrupted segment is detected by sender, since the corrupted packets still arrive at the TCP receiver. In the proposed scheme, the duplicated ACKs are processed differently by sender depending on whether there are any lost but not corrupted segments at present. Simulation results show that the proposed scheme could significantly improve TCP throughput over the heterogeneous wired and wireless networks with a high bit error rate, compared with the existing TCP and its variants. Copyright © 2008 John Wiley & Sons, Ltd.     

On network bandwidth sharing for transporting rate‐adaptive packet video using feedback

While existing research shows that feedback‐based congestion control mechanisms are capable of providing better video quality and higher link utilization for rate‐adaptive packet video, there has been relatively little study on how to share network bandwidth among competing rate‐adaptive video connections, when feedback control is used in a fully distributed network. This paper addresses this issue by presenting a framework of network bandwidth sharing for transporting rate‐adaptive packet video using feedback. We show how a weight‐based bandwidth sharing policy can be used to allocate network bandwidth among competing video connections and design a feedback control algorithm using an Available Bit Rate (ABR)‐like flow control mechanism. A novel video source rate adaptation algorithm is also introduced to decouple a video source's actual transmission rate from the rate used for distributed protocol convergence. Our feedback control algorithm provides guaranteed convergence and smooth source rate adaptation to our weight‐based bandwidth sharing policy under any network configuration and any set of link distances. Finally, we show the on‐line minimum rate renegotiation and weight adjustment options in our feedback control algorithm, which offer further flexibility in network bandwidth sharing for video connections. Copyright © 2000 John Wiley & Sons, Ltd.     

Adaptive low‐priority transfer for high bandwidth and delay product networks

As the exponential growth of the Internet, there is an increasing need to provide different types of services for numerous applications. Among these services, low‐priority data transfer across wide area network has attracted much attention and has been used in a number of applications, such as data backup and system updating. Although the design of low‐priority data transfer has been investigated adequately in low speed networks at transport layer, it becomes more challenging for the design of low‐priority data transfer with the adaptation to high bandwidth delay product networks than the previous ones. This paper proposes an adaptive low‐priority protocol to achieve high utilization and fair sharing of links in high bandwidth delay product networks, which is implemented at transport layer with an end‐to‐end approach. The designed protocol implements an adaptive congestion control mechanism to adjust the congestion window size by appropriate amount of spare bandwidth. The improved congestion mechanism is intent to make as much use of the available bandwidth without disturbing the regular transfer as possible. Experiments demonstrate that the adaptive low‐priority protocol achieve efficient and fair bandwidth utilization, and remain non‐intrusive to high priority traffic. Copyright © 2016 John Wiley & Sons, Ltd.     

Bandwidth estimation schemes for TCP over wireless networks

The use of enhanced bandwidth estimation procedures within the congestion control scheme of TCP was proposed recently as a way of improving TCP performance over links affected by random loss. This paper first analyzes the problems faced by every bandwidth estimation algorithm implemented at the sender side of a TCP connection. Some proposed estimation algorithms are then reviewed, analyzing and comparing their estimation accuracy and performance. As existing algorithms are poor in bandwidth estimation, and in sharing network resources fairly, we propose TIBET (time intervals based bandwidth estimation technique). This is a new bandwidth estimation scheme that can be implemented within the TCP congestion control procedure, modifying only the sender-side of a connection. The use of TIBET enhances TCP source performance over wireless links. The performance of TIBET is analyzed and compared with other schemes. Moreover, by studying TCP behavior with an ideal bandwidth estimation, we provide an upper bound to the performance of all possible schemes based on different bandwidth estimates.     

Adaptive Congestion Control of mSCTP for Vertical Handover Based on Bandwidth Estimation in Heterogeneous Wireless Networks

This paper proposes a new congestion control scheme of mobile Stream Control Transmission Protocol (mSCTP) for vertical handover across heterogeneous wireless/mobile networks. The proposed scheme is based on the estimation of available bandwidths in the underlying network as a cross-layer optimization approach. For congestion control of mSCTP, the initial congestion window size of the new primary path is adaptively configured, depending on the available bandwidth of the new link that a mobile node moves into. By ns-2 simulation, the proposed scheme is compared with the existing congestion control schemes in the throughput perspective. From the numerical results, we can see that the proposed mSCTP congestion control scheme could give better performance than the existing schemes in the wireless networks with an amount of background traffic.