TCP-Peach: a new congestion control scheme for satellite IPnetworks

Current TCP protocols have lower throughput performance in satellite networks mainly due to the effects of long propagation delays and high link error rates. In this paper, a new congestion control scheme called TCP-Peach is introduced for satellite networks. TCP-Peach is composed of two new algorithms, namely Sudden Start and Rapid Recovery, as well as the two traditional TCP algorithms, Congestion Avoidance and Fast Retransmit. The new algorithms are based on the novel concept of using dummy segments to probe the availability of network resources without carrying any new information to the sender. Dummy segments are treated as low-priority segments and accordingly they do not effect the delivery of actual data traffic. Simulation experiments show that TCP-Peach outperforms other TCP schemes for satellite networks in terms of goodput. It also provides a fair share of network resources     

Congestion window-based adaptive burst assembly for TCP traffic in OBS networks

Burst assembly is one of the key factors affecting the TCP performance in optical burst switching (OBS) networks. When the TCP congestion window is small, the fixed-delay burst assembler waits unnecessarily long, which increases the end-to-end delay and thus decreases the TCP goodput. On the other hand, when the TCP congestion window becomes larger, the fixed-delay burst assembler may unnecessarily generate a large number of small-sized bursts, which increases the overhead and decreases the correlation gain, resulting in a reduction in the TCP goodput. In this paper, we propose adaptive burst assembly algorithms that use the congestion window sizes of TCP flows. Using simulations, we show that the usage of the congestion window size in the burst assembly algorithm significantly improves the TCP goodput (by up to 38.4% on the average and by up to 173.89% for individual flows) compared with the timer-based assembly, even when the timer-based assembler uses the optimum assembly period. It is shown through simulations that even when estimated values of the congestion window size, that are obtained via passive measurements, are used, TCP goodput improvements are still close to the results obtained by using exact values of the congestion window.     

Enhancing Fairness and Throughput of TCP in Heterogeneous Wireless Access Networks

Most of the recent research on TCP over heterogeneous wireless networks has concentrated on differentiating between packet drops caused by congestion and link errors, to avoid significant throughput degradations due to the TCP sending window being frequently shut down, in response to packet losses caused not by congestion but by transmission errors over wireless links. However, TCP also exhibits inherent unfairness toward connections with long round-trip times or traversing multiple congested routers. This problem is aggravated by the difference of bit-error rates between wired and wireless links in heterogeneous wireless networks. In this paper, we apply the TCP Bandwidth Allocation (TBA) algorithm, which we have proposed previously, to improve TCP fairness over heterogeneous wireless networks with combined wireless and wireline links. To inform the sender when congestion occurs, we propose to apply Wireless Explicit Congestion Notification (WECN). By controlling the TCP window behavior with TBA and WECN, congestion control and error-loss recovery are effectively separated. Further enhancement is also incorporated to smooth traffic bursts. Simulation results show that not only can the combined TBA and WECN mechanism improve TCP fairness, but it can maintain good throughput performance in the presence of wireless losses as well. A salient feature of TBA is that its main functions are implemented in the access node, thus simplifying the sender-side implementation.     

多个TCP连接的拥塞丢包模型

本文提出了有关TCP连接的拥塞丢包分析模型.网络瓶颈一般承载许多TCP连接,瓶颈处不可避免的拥塞和缓存溢出,是导致网上丢包的主要原因.网络瓶颈处的行为很大程度上左右了网络性能.本文的模型估计了存在大量持续TCP连接时,网络瓶颈的丢包概率和网络传输中断概率,给出了对实际网络的良好近似.这对于研究TCP对网络性能的影响,提出改善网络性能的新算法,以及分析(从长远来看)TCP还应做哪些改进,都是非常有用的.     

大带宽时延积网络TCP Vegas自适应慢启动算法

TCP Vegas具有比TCP Reno更好的带宽利用能力和稳定性,但是在带宽时延积较大的网络中,TCP Vegas会出现慢启动过早结束、拥塞窗口过小的问题,降低了传输效率.文中在分析慢启动结束的原因和条件的基础上,提出一种对临时性排队时延进行估计,将其排除后再进行慢启动结束条件判断的TCP Vegas慢启动算法,对不同网络条件有自适应能力.仿真结果表明本算法能有效避免慢启动过早结束,使TCP性能明显改善.     

Analysis of source policy and its effects on TCP in rate-controlledATM networks

This paper provides an analysis of the source policy in the rate-based congestion control scheme developed by the Asynchronous Transfer Mode (ATM) Forum for available bit rate service and derives approximate analytical closed-form expressions to describe the rate increase process. These approximations are used to analyze the impact of the source algorithm on the TCP slow-start process operating over a rate-controlled ATM network. The results show that the increase in TCP congestion window ramp-up time is noticeable when the round-trip delay is small. The results are verified by simulation     

TCP Window Control for Variable Bandwidth in Wireless Cellular Networks

Most of TCP schemes in wireless networks assume that the bandwidth of the bottleneck link remains constant over time. However, in wireless cellular networks, to effectively manage the limited resources, the bandwidth is controlled based on radio condition over time. Such varying bandwidth can cause the networks congestion or underutilization. In this letter, we propose a new window control algorithm to improve TCP performance in wireless cellular networks with variable bandwidth. Simulation results illustrate that our proposal improves the performance of TCP in terms of fairness and link utilization     

即时恢复--一种新的TCP拥塞控制快速恢复算法

针对TCP连接的网络传输中经常会出现同一窗口多个分组丢失的情况,本文提出了一种新的TCP拥塞控制快速恢复算法:即时恢复算法。即时恢复算法能在恢复阶段探测网络的可用带宽,并将之用于窗口拥塞控制。另外,通过动态设定退出恢复阶段的参数域值,除了能恢复首次丢失的多个分组外,该算法还能很好的解决恢复阶段分组进一步丢失的情况。与SACK、FACK TCP等算法需要对TCP协议的发送、接收部分同时修改不同,该算法只需修改协议的发送部分,而接收部分不需作任何改变。在ns仿真环境的仿真结果表明:在同一窗口有多个分组丢失时,即时恢复算法的性能比TCP New-Reno有较大提高,与 SACK TCP性能相当。     

随机回退的TCP拥塞控制算法

 面对目前大量使用弃尾队列管理的网络中间节点,提出了一种随机回退的TCP拥塞控制算法TCP Njust,拥塞时在一定范围内随机减少拥塞窗口,拥塞避免时其拥塞窗口在一定范围内随机增加,以减缓TCP全局同步.该算法在Newreno基础上增加了一个随机函数,仿真表明该算法的性能优于Newreno,在网络突发数据流较多时,其性能优于Vegas,适合在Internet上使用.     

一种异构网络TCP拥塞控制算法

针对互联网中端对端带宽、时延和丢包率等的差异性日益加剧,导致TCP传输性能严重退化,该文提出一种链路自适应TCP拥塞控制算法(INVS)。INVS在拥塞避免阶段初期采用基于指数函数的凸窗口增长函数,以提高链路利用率;在窗口增长函数中引入了自适应增长因子实现窗口增长速率与链路状态相匹配;采用了自适应队列门限的丢包区分策略以提高无线环境下TCP的性能。性能分析和评估表明,INVS提高了TCP拥塞控制算法的吞吐量、公平性、链路利用率和RTT公平性。     

卫星TCP/ATM传输中的明确窗口指示拥塞控制策略研究

卫星ATM是近年来卫星通信领域的一个研究热点,TCP业务在卫星ATM中的传输是其中一个重要的研究课题.由于在TCP协议中主要是通过对窗口的控制来实现拥塞控制,而卫星信道传输的长延时特性大大降低了TCP层拥塞控制的效率.本文提出一种基于UBR传输的明确窗口指示拥塞控制策略,仿真结果表明在效率、公平性、VBR背景传输下的性能等各方面,取得了比目前广泛使用的Reno TCP更好的结果.并且该算法实现简单,交换机实现零信元丢失的缓冲区很小并且与TCP源连接的数目无关.     

Performance Analysis of TCP with Delayed Acknowledgments in Multi-hop Ad-hoc Networks

The acknowledgment strategy has great potential to increase TCP throughput when it runs over 802.11 MAC protocol. In particular, TCP acknowledgments (ACK) carry out an extensive number of medium accesses as they compete in the same route as data packets for media. In this paper, we first propose a dynamic TCP-MAC interaction strategy which tries to reduce the number of induced ACKs by monitoring the channel condition. To this end, the total collision probability collected along the path from sender to receiver in MAC layer has been used to properly set the number of delayed ACKs (DA) in TCP. Based on the estimated collision probability, TCP sender dynamically adjusts itself to the channel condition by delaying less ACKs in high traffic conditions and more ACKs in low traffic conditions. The simulation results show a throughput improvement up to 15% over the existing method called Dynamic Adaptive Acknowledgment (TCP-DAA) and much more over the regular TCP in different scenarios dealing with a dynamic loss rate. In addition, we show that our proposed strategy does not always benefit from a fixed delay policy along with a fixed congestion window size. In fact, the optimal number of delayed ACKs is based on the path length of a TCP connection and a large delay window may solely improve TCP throughput in short ranges with less number of flows. However, in a longer path congestion window limit provides more throughput gain.     

A time-dominated TCP congestion control over heterogeneous networks

The traditional transmission control protocol (TCP) suffers from performance problems such as throughput bias against flows with longer packet roundtrip time (RTT), which leads to burst traffic flows producing high packet loss, long delays, and high delay jitter. This paper proposes a TCP congestion control mechanism, TD-TCP, that the sender increases the congestion window according to time rather than receipt of acknowledgement. Since this mechanism spaces out data sent into the network, data are not sent in bursts. In addition, the proposed mechanism reduces throughput bias because all flows increase the congestion window at the same rate regardless of their packet RTT. The implementation of the mechanism affects only the protocol stack at the sender; hence, neither the receiver nor the routers need modifications. The mechanism has been implemented in the Linux platform and tested in conjunction with various TCP variants in real environments. The experimental result shows that the proposed mechanism 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 proposed mechanism's practical use. Copyright © 2008 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.     

TCP Westwood: End-to-End Congestion Control for Wired/Wireless Networks

TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless networks. The improvement is most significant in wireless networks with lossy links. In fact, TCPW performance is not very sensitive to random errors, while TCP Reno is equally sensitive to random loss and congestion loss and cannot discriminate between them. Hence, the tendency of TCP Reno to overreact to errors. An important distinguishing feature of TCP Westwood with respect to previous wireless TCP extensions is that it does not require inspection and/or interception of TCP packets at intermediate (proxy) nodes. Rather, TCPW fully complies with the end-to-end TCP design principle. The key innovative idea is to continuously measure at the TCP sender side the bandwidth used by the connection via monitoring the rate of returning ACKs. The estimate is then used to compute congestion window and slow start threshold after a congestion episode, that is, after three duplicate acknowledgments or after a timeout. The rationale of this strategy is simple: in contrast with TCP Reno which blindly halves the congestion window after three duplicate ACKs, TCP Westwood attempts to select a slow start threshold and a congestion window which are consistent with the effective bandwidth used at the time congestion is experienced. We call this mechanism faster recovery. The proposed mechanism is particularly effective over wireless links where sporadic losses due to radio channel problems are often misinterpreted as a symptom of congestion by current TCP schemes and thus lead to an unnecessary window reduction. Experimental studies reveal improvements in throughput performance, as well as in fairness. In addition, friendliness with TCP Reno was observed in a set of experiments showing that TCP Reno connections are not starved by TCPW connections. Most importantly, TCPW is extremely effective in mixed wired and wireless networks where throughput improvements of up to 550% are observed. Finally, TCPW performs almost as well as localized link layer approaches such as the popular Snoop scheme, without incurring the overhead of a specialized link layer protocol.     

Improving TCP Vegas Fairness in Presence of Backward Traffic

TCP Vegas provides better performance compared to traditional TCP Reno schemes. However, backward traffic significantly degrades Vegas efficiency causing underutilization of the available bandwidth and unfairness. In this letter, we present an enhanced congestion control mechanism for TCP Vegas able to correctly remove the undesired impact of reverse traffic on bandwidth sharing. Furthermore, our proposal is easily deployable because it does not require neither clock synchronization nor any special support at the intermediate routers     

Multi-layer loss recovery in TCP over optical burst-switched networks

It is well-known that the bufferless nature of optical burst-switching (OBS) networks cause random burst loss even at low traffic loads. When TCP is used over OBS, these random losses make the TCP sender decrease its congestion window even though the network may not be congested. This results in significant TCP throughput degradation. In this paper, we propose a multi-layer loss-recovery approach with automatic retransmission request (ARQ) and Snoop for OBS networks given that TCP is used at the transport layer. We evaluate the performance of Snoop and ARQ at the lower layer over a hybrid IP-OBS network. Based on the simulation results, the proposed multi-layer hybrid ARQ + Snoop approach outperforms all other approaches even at high loss probability. We developed an analytical model for end-to-end TCP throughput and verified the model with simulation results.     

TCP/IP网络的动态模型描述

拥塞现象成为TCP/IP网络发展面临的一个重要问题。因此，拥塞控制对TCP/IP网络的鲁棒性和稳定性具有重要作用。目前，网络拥塞控制策略主要包括两类：端到端的控制机制，如TCP拥塞控制算法；网络内部的主动队列管理(AQM)策略。但由于缺乏对网络系统动态特性的了解，这些拥塞控制策略大都基于专家经验，并没有建立完整的理论分析框架。为此，本文从数据流的角度出发，通过建立网络基本单元状态方程模型来实现IP网络系统的数学解析模型，然后用混杂系统来描述TCP带有拥塞控制策略的数据传输过程，建立了TCP/IP网络的动态模型，为网络系统中动态性能的分析、拥塞控制策略的设计奠定了基础。实验结果表明，该数学模型与NS仿真实验的结果相一致。     

MANET中TCP性能改进研究

TCP是为有线网络所设计的,其拥塞控制机制中,假设丢包是由网络拥塞造成的这一结论在MANET中不再适用。MANET中的高信道误码率,路由频繁中断等因素都会造成丢包。TCP错误的将所有丢包事件都当作拥塞处理,造成了传输性能的极大下降。文中首先总结了MANET中导致TCP传输性能下降的主要原因,然后对现有的一些典型TCP改进方案进行了讨论,最后对这些技术方案进行了比较,并指出今后研究的重点。