一种新的多瓶颈网络环境下的TCP算法

TCP拥塞控制算法作为一种可靠的数据传输被广泛应用在因特网．在保证网络稳定和不发生拥塞的基础上，公平性又是算法设计的另一个重要的性能指标．根据网络层显示拥塞指示技术支持，提出一种公平窗口算法，使该算法在IP网络中得以实现．仿真结果证明．此算法在多瓶颈网络环境下能使TCP流达到较好的公平性．     

RED的网络性能研究*

在很多网络中, 支持新的拥塞避免机制( 如RED 和ECN) 的节点将会和支持传统丢尾缓存( Drop-Tail) 的节点共存。研究含有两个拥塞节点的混杂网络中TCP 流集的性能, 比较了几种控制算法的数据流公平性, 仿真结果显示采用Adaptive 算法并不能增加数据流的公平性; 仿真也显示混杂网络中单个RED 参数的设置情况会影响整个网络的性能, 具体可以从网络吞吐量、响应时间等判断。RED 的参数设置在双瓶颈情况下再次变得重要, 正如在单瓶颈的情况下一样。     

基于UDP的可靠数据传输协议仿真研究

传统TCP协议在现代高速网络中的数据传输变的低效,具有不同往返时延的TCP数据流在竞争瓶颈带宽时将引发带宽不公平分配问题。基于UDP的可靠数据传输协议（UDP-based Data Transfer Protocol,UDT）是在UDP之上增加了可靠性和拥塞控制机制,适合于高速网络下的大量数据传输,具有很高的公平性。通过NS2仿真平台,改变瓶颈带宽、时延等形成不同的网络环境,在效率、公平、稳定等UDT目标性能上同传统TCP进行比较研究,结果显示UDT在高速网络环境下具有比传统TCP更优的传输性能。     

基于UDP的可靠数据传输协议仿真研究

传统TCP协议在现代高速网络中的数据传输变的低效,具有不同往返时延的TCP数据流在竞争瓶颈带宽时将引发带宽不公平分配问题.基于UDP的可靠数据传输协议(UDP-based Data Transfer Protocol, UDT)是在UDP之上增加了可靠性和拥塞控制机制,适合于高速网络下的大量数据传输,具有很高的公平性.通过NS2仿真平台,改变瓶颈带宽、时延等形成不同的网络环境,在效率、公平、稳定等UDT目标性能上同传统TCP进行比较研究,结果显示UDT在高速网络环境下具有比传统TCP更优的传输性能.     

面向数据中心租户带宽特征的虚拟拥塞控制方法性能分析

数据中心租户使用的遗留设备中仍存在没有实现显式拥塞通知ECN的情况,导致数据中心网络中存在ECN流抢占非ECN流带宽资源的不公平现象。虚拟拥塞控制方法通过修改数据包接收窗口字段进行拥塞控制,改善了上述不公平现象。从租户主机数目、带宽需求、网络拥塞程度、拥塞控制算法等四个角度出发,建立对应的符合数据中心租户带宽特征的仿真场景,通过仿真实验分析虚拟拥塞控制方法在上述场景中的性能。结果表明：（1)虚拟拥塞控制方法的性能良好,不受租户主机个数、租户带宽差异以及网络拥塞程度的影响;（2）虚拟拥塞控制算法的性能在拥塞控制算法不同环境下的表现存在差异,当使用YeAH TCP时解决ECN不公平性效果较差。     

适合GEO卫星网络的分层组播拥塞控制算法

针对GEO卫星网络高误码率、长延时的特点,提出了一种适合GEO卫星分层组播的拥塞控制算法,SLMCC.采用系统瓶颈处的队列信息作为调整层的依据,能够及时对网络状况做出反应,解决了卫星网络长延时特性带来的IGMP离开延时大的问题.通过周期性的比较组播数据流和TCP流的平均速率,动态调整组播层,满足了TCP友好性;针对不同分层体制的组播数据流,提出一种基于累积速率的层优先级调整策略,保证了多个不同分层体制的组播流之间的带宽公平性.另外,SLMCC设置一个比较系数,避免了卫星TCP性能下降导致组播数据流吞吐量的同步下降.仿真结果证明了SLMCC在GEO卫星网络环境中的有效性.     

高误码率无线环境的TCPW改进算法

针对TCP Westwood（简称TCPW）拥塞避免算法在高误码率无线网络环境下不能区分丢包原因和性能仍显不足的问题,在中间节点提出了一种简单有效的拥塞标记机制,称为CM（Congestion Marking）,它是基于ECN的,将拥塞程度划分为无拥塞、轻度拥塞和重度拥塞三种情况,与TCP Westwood算法结合,形成了基于ECN的TCPW CM算法,能有效地区分拥塞丢包和无线丢包。仿真实验表明,改进后的算法在高误码率情况下提高了网络利用率和吞吐量,同时仍具有良好的公平性和友好性。     

一种基于HSTCP的拥塞控制改进算法

针对TCP Reno在高带宽大延迟网络中带宽的利用率不高和HSTCP拥塞控制算法的公平性缺陷,该文提出了基于HSTCP的改进算法mHSTCP。当网络带宽未充分利用时,mHSTCP的窗口增长采用HSTCP模式,当网络状况趋于拥塞时,mHSTCP的窗口增长采用TCP Reno模式。测试结果表明,改进的mHSTCP算法对高速传输中不同流之间的公平性有明显的改善。     

一种改进的TCP拥塞控制算法的公平性研究

针对提高网络资源利用率,对TCP Reno拥塞控制算法进行改进,为实施拥塞优化控制,提出一种改进的拥塞控制算法。为判断该算法对所有数据流是否公平,在对其正确性和公平性进行理论分析后,构建NS2仿真模型并进行仿真,由于仿真结果数据量大,常规方法分析较为困难,故将仿真结果转换为数据库文件进行分析,该方法可操作性强,具有速度快,精度高,自主性强等优势;通过丢弃分组数的方差比较TCP Reno算法和改进算法在丢弃分组上的差异,通过延迟和延迟抖动标准差比较延迟和延迟抖动在不同数据流中的差异,上述参数更能从全局上反映多个比较项之间的整体差异。通过理论分析和仿真结果对比,该改进算法对于各数据流是公平的,且与TCP算法的公平性相当。     

基于TCP Vegas与TCP Reno的一种改进拥塞控制算法

因特网的快速发展带来了信息量的急剧膨胀,网络拥塞已经成为制约因特网发展的瓶颈。在众多TCP拥塞控制算法中,TCP Vegas表现出比其他算法更为优越的性能,然而自1995年提出至今,仍然没有取代TCP Reno成为现今最广泛使用的TCP拥塞控制算法。有研究表明,这是由于Vegas在与Reno共存的网络环境下不能公平地竞争到带宽,因此不能实实质性地提高网络性能。本文在分析Vegas与Reno如何在网络路由中占用带宽的基础上,提出一种在两者兼容环境下的拥塞控制方法,根据不同瓶颈缓冲区容量合理选择α、β等参数,实现了在Vegas与Reno共存环境下两者良好的兼容性,并通过仿真实验证明了该算法的有效性和正确性。     

Investigating the performance of TCP in mobile ad hoc networks

Mobile ad hoc networks have several inherent characteristics (e.g. dynamic topology, time-varying and bandwidth constrained wireless channels, multi-hop routing, and distributed control and management). The goal of this work is to investigate the impact of these characteristics on the performance of TCP. First, we investigate throughput performance of TCP as a function of path length (i.e. multiple wireless hops), node mobility, and traffic intensity. Next, we examine the ‘fairness’ of the ad hoc network with regard to equal sharing of network bandwidth among multiple TCP flows. Third, we evaluate the impact of two on-demand routing protocols (i.e. AODV and DSR) on the throughput of TCP. Finally, a factorial design experiment is conducted to quantify the effects and interactions of three factors, which influence the throughput of TCP. These factors include routing, node speed, and node pause time. Two key results were observed. Results show that traffic intensity (e.g. number of concurrent flows) is significantly affects TCP throughput, suggesting the need for congestion control, scheduling and traffic management schemes. Second, source routing achieves higher throughputs while also generating significantly less routing overhead than AODV. Results also show that in some instances, the fairness of the network is very uneven among concurrent TCP flows, resulting in several sending stations achieving very little or no throughput.     

Improving TCP fairness and performance with bulk transmission control over lossy wireless channel

The traditional windows-based TCP congestion control mechanism produces throughput bias against flows with longer packet roundtrip times; the flow with a short packet roundtrip time preoccupies the shared network bandwidth to a greater extent than others. Moreover, the blind window reduction that occurs whenever packets are lost decreases the network utilization severely, especially in networks with high packet losses. This paper proposes a sender-based TCP congestion control, called TCP-BT. The scheme estimates the network bandwidth depending on the transmission behavior of applications, and adjusts the congestion window by considering both the estimated network bandwidth and the packet roundtrip time to improve fairness as well as transmission performance. The scheme has been implemented in the Linux platform and compared with various TCP variants in real environments. The experimental results show that the proposed scheme improves transmission performance, especially in networks with congestion and/or high packet loss rates. Experiments in real commercial wireless networks have also been conducted to support the practical use of the proposed mechanism.     

Achieving high throughput and TCP Reno fairness in delay-based TCP over large networks

The transport control protocol (TCP) has been widely used in wired and wireless Internet applications such as FTP, email and http. Numerous congestion avoidance algorithms have been proposed to improve the performance of TCP in various scenarios, especially for high speed and wireless networks. Although different algorithms may achieve different performance improvements under different network conditions, designing a congestion algorithm that can perform well across a wide spectrum of network conditions remains a great challenge. Delay-based TCP has a potential to overcome above challenges. However, the unfairness problem of delay-based TCP with TCP Reno blocks widely the deployment of delay-based TCP over wide area networks. In this paper, we proposed a novel delay-based congestion control algorithm, named FAST-FIT, which could perform gracefully in both ultra high speed networks and wide area networks, as well as keep graceful fairness with widely deployed TCP Reno hosts. FAST-FIT uses queuing delay as a primary input for controlling TCP congestion window. Packet loss is used as a secondary signal to adaptively adjust parameters of primary control process. Theoretical analysis and experimental results show that the performance of the algorithm is significantly improved as compared to other state-of-the-art algorithms, while maintaining good fairness.     

FAST TCP拥塞控制机制研究

随着网络带宽和距离的不断增大,传统的TCP协议已经成为阻碍网络高速传输的瓶颈。本文介绍了一种新的拥塞控制算法——FASTTCP,它能够使大带宽长距离网络保持较好的性能。     

TCP with gateway adaptive pacing for multihop wireless networks with Internet connectivity

This paper introduces an effective congestion control pacing scheme for TCP over multihop wireless networks with Internet connectivity. The pacing scheme is implemented at the wireless TCP sender as well as at the Internet gateway, and reacts according to the direction of TCP flows running across the wireless network and the Internet. Moreover, we analyze the causes for the unfairness of oncoming TCP flows and propose a scheme to throttle aggressive wired-to-wireless TCP flows at the Internet gateway to achieve nearly optimal fairness. The proposed scheme, which we denote as TCP with Gateway Adaptive Pacing (TCP-GAP), does not impose any control traffic overhead for achieving fairness among active TCP flows and can be incrementally deployed since it does not require any modifications of TCP in the wired part of the network. In an extensive set of experiments using ns-2 we show that TCP-GAP is highly responsive to varying traffic conditions, provides nearly optimal fairness in all scenarios and achieves up to 42% more goodput for FTP-like traffic as well as up to 70% more goodput for HTTP-like traffic than TCP NewReno. We also investigate the sensitivity of the considered TCP variants to different bandwidths of the wired and wireless links with respect to both aggregate goodput and fairness.     

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

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

Logarithmic window increase for TCP Westwood+ for improvement in high speed,long distance networks

The majority of current Internet applications uses Transmission Control Protocol (TCP) for ensuring reliable end-to-end delivery of data over IP networks. The resulting path is, generally speaking, characterized by fairly large propagation delays (of the order of tens to hundreds of milliseconds) and increasing available bandwidth. Current TCP¹performance is far from representing an optimal solution in such operating conditions. The main reason lies in the conservative congestion control strategy employed, which does not let TCP to exploit the always increasing available path capacity. As a consequence, TCP optimization has been an active research topic in the research community over the last 25 years, boosted in the last few years by the widespread adoption of high-speed optical fiber links in the backbone and the emergence of supercomputing networked applications from one side and tremendous growth of wireless bandwidth in network access from another. This has led to the introduction of several alternative proposals for performing congestion control. Most of them focus on the effectiveness of bandwidth utilization, introducing more “aggressive” congestion control strategies. However, such approaches result often in unfairness among flows with substantially different RTTs, or do not present the inter-protocol fairness features required for incremental network deployment.In this paper, we propose TCP LogWestwood+, a TCP Westwood+ enhancement based on a logarithmic increase function, targeting adaptation to the high-speed wireless environment. The algorithm shows low sensitivity with respect to RTT value, while maintaining high network utilization in a wide range of network settings. The performance, fairness and stability properties of the proposed TCP LogWestwood+ are studied analytically, and then validated by means of an extensive set of experiments including computer simulations and wide area Internet measurements.     

SABUL: A Transport Protocol for Grid Computing

This paper describes SABUL, an application-level data transfer protocol for data-intensive applications over high bandwidth-delay product networks. SABUL is designed for reliability, high performance, fairness and stability. It uses UDP to transfer data and TCP to return control messages. A rate-based congestion control that tunes the inter-packet transmission time helps achieve both efficiency and fairness. In order to remove the fairness bias between flows with different network delays, SABUL adjusts its sending rate at uniform intervals, instead of at intervals determined by round trip time. This protocol has demonstrated its efficiency and fairness in both experimental and practical applications. SABUL has been implemented as an open source C++ library, which has been successfully used in several Grid computing applications.