FCA-ItswTCM:区分服务中一种公平的拥塞自适应标记算法

 本文提出了一种新的滑动窗口标记算法——公平的拥塞自适应标记算法(FCA-ItswTCM).算法近似识别TCP流和UDP流,适度区分标记,规避拥塞控制机制对公平性的影响;细粒度描述拥塞,预测拥塞,以此自适应调节各流注入黄包比例,兼顾网络拥塞状态对公平性的影响.仿真实验表明,与其他几种滑动窗口标记算法相比,FCA-ItswTCM对确保TCP流和UDP流带宽共享的公平性、提高资源利用率及系统稳定性有较好的效果.     

无线传感器网络拥塞控制机制研究

本论文在分析无线传感器网络不同于普通有线网络的特征后,提出了一种适用于无线传感器网络的TCP 拥塞控制机制DW-TCP,此机制将TCP拥塞窗口分为拥塞丢包窗口和误码丢包窗口,在链路误码率较高时通过降低发送速率提高数据发送的可靠性,节约无线节点的能源消耗和系统不必要的开销,该机制不但考虑到拥塞丢包对数据发送速率的影响,而且考虑到无线链路中的误码丢包对数据发送速率的影响.     

无线网络中TCP友好流媒体传输改进机制

为保持无线网络中多媒体业务对TCP的友好性，提出了一种适用于无线网络的动态自适应的流媒体传输速率调节机制。该机制通过在接收端区分网络拥塞丢包和链路错误随机丢包，准确判断网络的拥塞状况结合接收端缓存区占用程度，自适应实施多级速率调节，实现了TCP流友好性和流媒体服务质量（QoS）的折中。由于准确区分出无线链路误码丢包和动态调整流媒体QoS要求，该机制能维持较高的网络利用率。仿真实验结果显示在连接数为2和32，链路误码率从0到0．1变化时TCP,TFRC和吞吐量幅度下降幅度较大，WTFCC幅度下降相对较慢，最大相差达2M；在网络负载重时，尽管链路误码率较低，WTFCC区分链路错误与拥塞丢包，因此，端到端丢包率高于TCP和TFRC，但整体传输吞吐量也高于两者。归一化吞吐量显示WTFCC对TCP流友好。     

一种平滑的基于AIMD的TCP拥塞控制算法------SISD

提出一种基于AMID(Additive Increase Multiplicative Decrease)的双平滑TCP拥塞控制算法,即SISD(Smooth Increase Smooth Decrease)。SISD算法在数据包发送方面采用一个单调递减函数作为提升速度的增量函数。当检测到网络拥塞时,依据历史拥塞窗口的大小调整发送窗口大小,避免了不必要的网络抖动。仿真结果显示,当UDP、TCP协议并存时,SISD可以为UDP协议提供稳定、平滑的服务,且具备较好的稳定性、公平性,同时提高网络带宽的利用率。     

SCPS-TP协议在卫星通信系统中的应用研究

将空间互联网协议SCPS-TP用于卫星通信系统中,并以SCPS-TP所使用的Vegas拥塞控制策略为基础,借鉴了TCP Hvbla协议慢启动阶段拥塞窗口增长策略,同时对发生丢包及超时情况的拥塞窗口和慢启动阈值的变化进行了修改,从而提出了一种更适合于卫星通信链路应用的改进型Vegas方法.对该方法在GEO卫星通信系统链路中的应用进行了NS2软件仿真,并与TCP Vegas和TCP NewReno方法进行比较与分析.结果表明,该改进型Vegas拥塞控制策略的平均吞吐量较TCP Vegas有15%的提高.     

TCP Vegas-O:一种新的基于延迟估计的TCP Vegas改进算法

针对TCP Vegas会出现慢启动过早结束、拥塞窗口过小导致带宽利用率下降的问题,以及在与Reno等基于丢包来判断拥塞的算法竞争带宽时的公平性差等问题,文中分别就慢启动和拥塞避免阶段进行了相应的改进,最后将其结合.仿真结果表明,该算法对慢启动过早结束、带宽公平性等TCP Vegas协议的缺陷有了明显的改善,特别是在高带宽时延乘积网络中.     

TCP在无线环境中的性能改进技术研究

对TCP拥塞控制算法作了一些改进,以适应于无线链路传输环境.基本方法是根据TCP测量的RTT值动态估计当前链路可用带宽,重新计算并设置拥塞窗口cwnd值.仿真显示,改进后的TCP应用于无线环境性能有了较大的改进.     

混合网络环境下的TCPW改进算法

针对TCP Westwood(简称TCPW)拥塞避免算法在高误码率无线网络环境下不能区分丢包原因和性能仍显不足的问题,分析RTT的变化,提出了一种简单有效的改进算法,称为TCP VT,能有效地区分拥塞丢包和无线丢包,仿真实验表明,改进后的算法在高误码率情况下提高了网络利用率和吞吐量,同时仍具有良好的公平性和友好性.     

TCP拥塞控制慢启动策略的研究

分析了现有的慢启动策略,针对现有策略中拥塞窗口增长不够平滑的问题,提出了一种新的慢启动方式。用NS2进行了仿真,比较了慢启动策略和传统策略的性能。结果表明,和传统策略相比,采用的慢启动策略时,拥塞窗口值的增长更趋平滑,丢包率明显减小,瓶颈链路的利用率也有所提高。     

基于ECN跨层机制的无线TCP性能改进方案

针对无线环境下TCP（传输控制协议）调用拥塞控制算法致使性能下降的问题,提出一种基于ECN（显式拥塞通知）跨层机制的无线TCP改进方法。算法在ECN机制上判断网络是否拥塞以及丢包发生时具体丢包类型。并在此基础上针对网络具体状况采取不同的拥塞窗口控制机制,更精确的网络信息有效提高了数据发送的可靠性。仿真结果表明该算法可提...     

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

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

Using TCP rate control for queue input‐output rate matching

In explicit TCP rate control, the receiver's advertised window size in acknowledgment (ACK) packets can be modified by intermediate network elements to reflect network congestion conditions. The TCP receiver's advertised window (i.e. the receive buffer of a TCP connection) limits the maximum window and consequently the throughput that can be achieved by the sender. Appropriate reduction of the advertised window can control the number of packets allowed to be sent from a TCP source. This paper evaluates the performance of a TCP rate control scheme in which the receiver's advertised window size in ACK packets are modified in a network node in order to match the generated load to the assigned bandwidth in the node. Using simulation and performance metrics such as the packet loss rates and the cumulative number of TCP timeouts, we examine the service improvement provided by the TCP rate control scheme to the users. The modified advertised windows computed in the network elements and the link utilization are also examined. Copyright © 2002 John Wiley & Sons, Ltd.     

Packet Recycling and Delayed ACK for Improving the Performance of TCP over MANETs

Most of the schemes that were proposed to improve the performance of transmission control protocol (TCP) over mobile ad hoc networks (MANETs) are based on a feedback from the network, which can be expensive (require extra bandwidth) and unreliable. Moreover, most of these schemes consider only one cause of packet loss. They also resume operation based on the same stand-by parameters that might vary in the new route. Therefore, we propose two techniques for improving the performance of TCP over MANETs. The first one, called TCP with packet recycling (TCP-PR), allows the nodes to recycle the packets instead of dropping them after reaching the retransmission limit at the MAC layer. In the second technique, which is called TCP with adaptive delay window (TCP-ADW), the receiver delays sending TCP ACK for a certain time that is dynamically changed according to the congestion window and the trip time of the received packet. TCP-PR and TCP-ADW are simple, easy to implement, do not require network feedback, compatible with the standard TCP, and do not require distinguishing between the causes of packet loss. Our thorough simulations show that the integration of our two techniques improves the performance of TCP over MANETs.     

Predictive Congestion Control Protocol for Wireless Sensor Networks

Available congestion control schemes, for example transport control protocol (TCP), when applied to wireless networks, result in a large number of packet drops, unfair scenarios and low throughputs with a significant amount of wasted energy due to retransmissions. To fully utilize the hop by hop feedback information, this paper presents a novel, decentralized, predictive congestion control (DPCC) for wireless sensor networks (WSN). The DPCC consists of an adaptive flow and adaptive back-off interval selection schemes that work in concert with energy efficient, distributed power control (DPC). The DPCC detects the onset of congestion using queue utilization and the embedded channel estimator algorithm in DPC that predicts the channel quality. Then, an adaptive flow control scheme selects suitable rate which is enforced by the newly proposed adaptive backoff interval selection scheme. An optional adaptive scheduling scheme updates weights associated with each packet to guarantee the weighted fairness during congestion. Closed-loop stability of the proposed hop-by-hop congestion control is demonstrated by using the Lyapunov-based approach. Simulation results show that the DPCC reduces congestion and improves performance over congestion detection and avoidance (CODA) [3] and IEEE 802.11 protocols.     

TCP Over the IEEE 802.15.3 MAC: Analysis and Simulation

High data rate wireless technologies are now becoming a reality, and have spurred the development of new applications that were previously hindered by the lack of capacity. In particular, it is now possible to stream high definition movies from a laptop to a sound system and flat screen television seamlessly. One of the key enablers of such applications is the IEEE 802.15.3 medium access control (MAC) protocol, which is designed to support bandwidth intensive applications in wireless personal area networks (WPANs). A key observation is that a significant number of multi-media applications rely on the transmission control protocol (TCP). Unfortunately, little works have conducted a thorough performance study of TCP over the IEEE 802.15.3 MAC. Moreover, the IEEE 802.15.3 specification does not specify any strategies for allocating time slots. This paper therefore contributes to the current state-of-the-art in the following manners. From our extensive analytical and simulation studies, we reveal the impacts of different channel time allocation methods and acknowledgment policies on the performance of TCP, with particular attention on round trip time, congestion window growth, and packet recovery. We then present the following guidance to application developers: (1) channel time allocations (CTAs) should be distributed evenly over the superframe and have durations determined by TCP’s maximum congestion window, (2) CTA positioning has no impact on TCP’s performance, and (3) the specified delayed acknowledgment policy needs to be augmented with an adaptive algorithm that adjusts its burst size dynamically to varying bit error rate (BER).     

Comparative analysis of cumulative distribution function for TCP congestion window size and triple‐duplicate period

Various version of Transmission Control Protocol (TCP) congestion window model are available in the literature. TCP congestion control is handled in two phases: (a) slow start and (b) congestion avoidance. This paper deals with congestion avoidance phase that is based on additive increase multiplicative decrease (AIMD) mechanism in which window size either increase by one or cuts to half of the previous window size. For distribution of window sizes, a model developed by Yan et al has been presented for two loss indications: (a) triple duplicate (TD) and (b) time‐outs (TOs) only while it does not deal with the window size limitation. It does not allow to cap over the TCP congestion window size if the buffer size is restricted to a fixed value though window size could not move beyond that. The unconstrained window size moves on in the presence of low loss probability. In this paper, we propose a model for the case where the window size is bounded by a maximum value that makes applicable to window size limitation as well. Further, the work has been extended to develop a new model that obtains a cumulative distribution function for TD periods (TDPs). The proposed model is validated on ns‐2, and we conclude that observed results for distribution function are very closed to our proposed model.     

TCP/IP performance with random loss and bidirectional congestion

With the growth in Internet access services over networks with asymmetric links such as asymmetric digital subscriber line (ADSL) and cable-based access networks, it becomes crucial to evaluate the performance of TCP/IP over systems in which the bottleneck link speed on the reverse path is considerably slower than that on the forward path. In this paper, we provide guidelines for designing network control mechanisms for supporting TCP/IP. We determine the throughput as a function of buffering, round-trip times, and normalized asymmetry (defined as the ratio of the transmission time of acknowledgment (ACK) in the reverse path to that of data packets in the forward path). We identify three modes of operation which are dependent on the forward buffer size and the normalized asymmetry, and determine the conditions under which the forward link is fully utilized. We also show that drop-from-front discarding of ACKs on the reverse link provides performance advantages over other drop mechanisms in use. Asymmetry increases the TCP already high sensitivity to random packet losses that occur on a time scale faster than the connection round-trip time. We generalize the by-now well-known relation relating the square root of the random loss probability to obtained TCP throughput, originally derived considering only data path congestion. Specifically, random loss leads to significant throughput deterioration when the product of the loss probability, the normalized asymmetry and the square of the bandwidth delay product is large. Congestion in the reverse path adds considerably to TCP unfairness when multiple connections share the reverse bottleneck link. We show how such problems can be alleviated by per-connection buffer and bandwidth allocation on the reverse path     

Improving TCP performance in mobile networks

In this letter, a new transport layer mechanism is proposed to improve the performance of transport control protocol (TCP) in mobile networks. The proposed mechanism is comprised of two parts: a loss classifier (LC) and a congestion window extrapolator (CWE). Based on LC, the cause of packet loss during roaming is determined. If the loss is considered to be caused by congestion in the wireline, the congestion window is halved; otherwise, the packet is considered to be lost in the last hop, the wireless portion, and the sender adjusts the size of the congestion window based on CWE. We conduct simulations to evaluate the performance of the proposed mechanism. The results show that our mechanism significantly improves TCP performance as compared with existing solutions for mobile networks.     

Performance evaluation of high speed TCP over optical burst switching networks

Study of TCP performance over OBS networks has been an important problem of research lately and it was found that due to the congestion control mechanism of TCP and the inherent bursty losses in the Optical Burst Switching (OBS) network, the throughput of TCP connections degrade. On the other hand, High Speed TCP (HSTCP) was proposed as an alternative to the use of TCP in high bandwidth-delay product networks. HSTCP aggressively increases the congestion window used in TCP, when the available bandwidth is high and decreases the window cautiously in response to a congestion event. In this work, we make a thorough simulation study of HSTCP over OBS networks. While the earlier works in the literature used a linear chain of nodes as the network topology for the simulation, we use the popular 14-node NSFNET topology that represents an arbitrary mesh network in our study. We also study the performance of HSTCP over OBS for different bandwidths of access networks. We use two different cases for simulations where in the first HSTCP connections are routed on disjoint paths while in the second they contend for resources in the network links. These cases of simulations along with the mesh topology help us clearly distinguish between the congestion and contention losses in the OBS network and their effect on HSTCP throughput. For completeness of study, we also simulate TCP traffic over OBS networks in all these cases and compare its throughput with that of HSTCP. We observe that irrespective of the access network bandwidth and the burst loss rate in the network, HSTCP outperforms TCP in terms of the throughput and robustness against multiple burst losses up to the expected theoretical burst loss probability of 10⁻³.     

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