TCP稳态流中慢启动序列对吞吐量性能的影响

在计算TCP稳态数据流吞吐量时一般都忽略了由于分组丢失而形成的各个慢启动阶段。在考虑TCP稳态数据流中慢启动序列的情况下,对Padhye的经典TCP稳态数据流模型进行了扩展。通过将Padhye的模型与扩展后的模型作比较,证明了在使用Padhye的模型作为多媒体流量控制模型时忽略超时后慢启动阶段的可行性和正确性。     

考虑慢启动影响的TCP吞吐量模型

TCP吞吐量模型的研究是网络协议研究的一个重要方面,同一些其它模型相比,Padhye提出的TCP吞吐量模型比较精确地描述了TCP吞吐量与往返时间、丢包率和超时时限的关系,但在丢包率很高的场合,Padhye模型误差较大,本文分析了高网络负荷下TCP传输的性能,提出了一个高网络负荷下TCP吞吐量的改进Padhye模型,实验表明,该模型在高网络负荷环境下更接近实际情况.     

TCP-Rab的吞吐量模型及实验研究

基于接收端通告的TCP(TCP-Rab,receiver advertisement based TCP)协议是我们实现的一种新的TCP协议,在文献[1]中对TCP-Rab的算法设计、实现进行了详细阐述。本文对TCP-Rab进行了少量改进,重点导出了TCP-Rab的吞吐量性能模型,并对TCP-Rab进行了试验研究。该模型采用统计的方法,在导出TCP-Rab的吞吐量性能模型的时候,不仅考虑了TCP连接的拥塞避免阶段对吞吐量的影响,也考虑了慢启动阶段对吞吐量的影响,同时还考虑了一个发送窗口内多个数据包随机丢失对吞吐量的影响,因此该模型能适用于实际的网络环境中。     

基于Gilbert丢包机制的TCP吞吐量模型

 丢包机制是推导TCP吞吐量模型的关键,直接影响模型的准确性.本文利用四状态Gilbert丢包机制来描述端到端路径上的丢包行为,对TCP的拥塞控制过程进行建模,在此基础上提出了一种更精确的TCP吞吐量模型.实验表明,改进的模型能较好的与实际值相拟合,可以更精确地预测实际TCP数据流的吞吐量性能.     

数据包大小对TCP流性能的影响

在互联网时代,如何提高网络通信质量一直是研究热点,当前网络通信大部分数据流都采用TCP流。对于TCP流性能的影响因素如丢包、时延已有大量研究,但是数据包大小对其的影响却罕有涉及。另一方面,网络通信的质量很大程度上取决于路由器的性能,而路由器的性能又很大程度上取决于路由器的缓存设置。因此本文从数据包大小这一新的切入点入手,研究在不同的路由器缓存下,其对TCP流性能的影响。论文介绍了TCP协议、路由器缓存、数据包等相关概念,提出了实验方案的网络拓扑模型,选择了NS2平台进行网络仿真。在实验中,我们通过改变数据包大小和路由器缓存容量,得到了对应的实验数据并进行了分析整理,总结出了TCP流吞吐量和丢包率在数据包大小改变时的变化规律,即丢包率随数据包大小的增加呈线性增长,路由器缓存越小丢包率越大;TCP流的吞吐量随数据包大小的增加缓慢变大,路由器缓存达到一定值后不再成为瓶颈因素。     

一种3GPP LTE网络的TCP拥塞控制方法

现有的传输控制协议(TCP)拥塞控制机制源自有线网络,未考虑无线基站介质访问控制(MAC)层调度器的特性,影响了TCP协议在长期演进(LTE)系统上的传输性能。提出一种跨层的TCP拥塞控制方法,由MAC层和TCP共同解决TCP虚假超时问题。此方法中,MAC层提供超时信息,TCP层识别出虚假超时后调整数据速率,从而避免系统性能损失,保证MAC层稳定工作。仿真结果表明,在保证用户公平性的同时,新方法可以有效解决虚假超时问题,提高用户实际吞吐量。     

基于自动机的TCP流识别算法

为提升网络流识别性能,本文提出了一种TCP流识别算法.该算法基于传输控制协议(Transmission Control Protocol,TCP)下网络通信双方的交互过程构建双向流自动机,由该自动机根据TCP协议规则和网络流当前状态判断TCP流终止,同时以基于规则的过滤机制和超时策略为辅助措施,快速识别单包流和异常中断流.该算法内存开销、计算和内存总开销均低于经典算法固定超时策略(Fixed Timeout strategy,FT)和同类代表性算法两层自适应超时策略(Two-level Self-Adaptive Timeout,TSAT),同时该算法精度高于TSAT,且仅比默认精度标准略有下降.该算法基于协议规则识别TCP流,既保证了流的准确性,又节省了流的超时等待时间,而且算法尤其适合中流、小流和不规则TCP流比重较大的情况,使得识别系统在面临DDoS攻击、蠕虫爆发等网络异常时仍能正常运行.     

基于改进神经网络的LDoS攻击感知

低速率拒绝服务(LDoS)攻击又称为降质服务攻击(RoQ),是一种新型的拒绝服务攻击方式,其特点是利用TCP重传超时机制的漏洞,周期性地发送短时高速脉冲攻击数据包,降低TCP吞吐量,由于反复发送LDoS攻击包的速率很高,流量会重复超时,导致网络拒绝服务。由于平均速率较低,即使TCP的吞吐量减少,攻击者仍然不容易被发现,隐蔽性极强,不易检测。文中提出基于LDoS攻击流量在频域的自身特征进行检测,改进BP神经网络,降低训练样本"异常值"对收敛速度的影响,对LDoS特征进行训练学习,综合诊断,从而提高LDoS攻击感知的检测率和鲁棒性。     

IEEE 802.11 DCF对TCP性能的影响及算法改进

本文讨论了IEEE 802.11 DCF两种方式(RTS/CTS和CSMA/CA)混合工作时TCP的性能,发现高负载时TCP流存在不稳定的问题.基于此提出了RWB(Reserve Window Backoff)算法,该算法从联合优化的角度出发,减轻了WLAN MAC接入机制和TCP拥塞控制之间的不良影响,从而提高了TCP的吞吐量,改善了TCP流的稳定性.文中通过仿真对算法进行了分析和研究.     

MANET中TCP协议的性能改进

在移动Ad hoc网络(MANET)中，网络的多跳性和移动性是影响TCP协议性能的主要原因。本文详细分析了这两个特性对性能的影响，分别提出了相应的改进方案并在仿真器上实现。仿真结果表明，改进方案使TCP吞吐量获得很大提高，并且能够很好地适应移动网络拓扑的快速变化。     

Modeling TCP SACK performance over wireless channels with completely reliable ARQ/FEC

In this paper, we propose an analytical cross‐layer model for a Transmission Control Protocol (TCP) connection running over a covariance‐stationary wireless channel with a completely reliable Automatic Repeat reQuest scheme combined with Forward Error Correction (FEC) coding. Since backbone networks today are highly overprovisioned, we assume that the wireless channel is the only one bottleneck in the system which causes packets to be buffered at the wired/wireless interface and dropped as a result of buffer overflow. We develop the model in two steps. At the first step, we consider the service process of the wireless channel and derive the probability distribution of the time required to successfully transmit an IP packet over the wireless channel. This distribution is used at the next step of the modeling, where we derive expressions for the TCP long‐term steady‐state throughput, the mean round‐trip time, and the spurious timeout probability. The developed model allows to quantify the joint effect of many implementation‐specific parameters on the TCP performance over both correlated and non‐correlated wireless channels. We also demonstrate that TCP spurious timeouts, reported in some empirical studies, do not occur when wireless channel conditions are covariance‐stationary and their presence in those measurements should be attributed to non‐stationary behavior of the wireless channel characteristics. Copyright © 2011 John Wiley & Sons, Ltd.     

Analytic models for the latency and steady-state throughput of TCP Tahoe, Reno, and SACK

Continuing the process of improvements made to TCP through the addition of new algorithms in Tahoe and Reno, TCP SACK aims to provide robustness to TCP in the presence of multiple losses from the same window. In this paper we present analytic models to estimate the latency and steady-state throughput of TCP Tahoe, Reno, and SACK and validate our models using both simulations and TCP traces collected from the Internet. In addition to being the first models for the latency of finite Tahoe and SACK flows, our model for the latency of TCP Reno gives a more accurate estimation of the transfer times than existing models. The improved accuracy is partly due to a more accurate modeling of the timeouts, evolution of cwnd during slow start and the delayed ACK timer. Our models also show that, under the losses introduced by the droptail queues which dominate most routers in the Internet, current implementations of SACK can fail to provide adequate protection against timeouts and a loss of roughly more than half the packets in a round will lead to timeouts. We also show that with independent losses SACK performs better than Tahoe and Reno and, as losses become correlated, Tahoe can outperform both Reno and SACK.     

Detecting spurious timeouts in wireless cellular networks using DS‐Agent

Large and sudden variations in packet transmission delays are often unavoidable in wireless networks. Such large delays, refer to as delay spikes (DSs), are likely to exceed several times the typical network round‐trip‐time figures, which can cause TCP spurious timeouts. The spurious timeouts lead to unnecessary retransmissions and reduction of the TCP sender's transmission rate, and degradation of TCP throughput. In this paper we propose a new scheme called DS‐Agent. The spurious timeout is detected by a DS‐Agent and thus TCP sender can response to this spurious timeout accordingly. The simulation results show the better performance of DS‐Agent scheme compared with F‐RTO and TCP Reno in the presence of DSs which is caused by mobility. Copyright © 2006 John Wiley & Sons, Ltd.     

TCP throughput and fairness performance in presence of delay spikes in wireless networks

Wireless networks are likely to experience delay spikes exceeding several times the typical round‐trip‐time figures, which can cause spurious timeouts that lead to unnecessary retransmissions and reduction of the TCP sender's transmission rate, and thus, the throughput of the TCP is degraded. This paper presents some research results on the effect of delay spikes caused by handover on TCP performance by using three different mobility models. It is shown that the throughput of TCP connection over a single bottleneck link is decreased in the presence of delay spikes significantly. Furthermore, it is shown that the fairness feature of TCP is also severely affected in the presence of delay spikes. Copyright © 2005 John Wiley & Sons, Ltd.     

一种基于链路带宽估计的无线TCP改进算法

本文提出了一种能够通过带宽估计来判断无线链路报文段丢失原因,并采取相应拥塞控制机制的无线TCP算法-TCP_LD(TCP Loss Detection).文章采用Padhye模型的建模方法,推导了TCP_LD的稳态流量模型.理论分析和仿真结果说明,TCP_LD能够有效的区分出发生报文段丢失的原因,即拥塞丢失或者链路突发差错,从而提高系统的流量.     

A Novel Wireless TCP and its Steady State Throughput Model

1　Introduction　WiththegrowthofwirelessnetworksandtheInter net,thedatatransmissionserviceoverwirelessnet worksbecomesmoreattractive .InthecurrentInternet,TCPiswidelyusedinpopularapplicationslikeTelnet,FTP ,andHTTP .　TCPisareliableconnection oriented protocolthatimplementscongestioncontrolbymeansofaslidingwindowalgorithm .TCPTahoeandReno[1～ 2 ] ,whichmakeuseoftheSlowStart (SS)andCongestionAvoid ance (CA)algorithmstoadjustthewindowsize ,havegotmuchsuccessintheInternet.Inparticular…     

TCP Performance in IEEE 802.11-Based Ad Hoc Networks with Multiple Wireless Lossy Links

We propose a packet-level model to investigate the impact of channel error on the transmission control protocol (TCP) performance over IEEE-802.11-based multihop wireless networks. A Markov renewal approach is used to analyze the behavior of TCP Reno and TCP Impatient NewReno. Compared to previous work, our main contributions are listed as follows: 1) modeling multiple lossy links, 2) investigating the interactions among TCP, Internet Protocol (IP), and media access control (MAC) protocol layers, specifically the impact of 802.11 MAC protocol and dynamic source routing (DSR) protocol on TCP throughput performance, 3) considering the spatial reuse property of the wireless channel, the model takes into account the different proportions between the interference range and transmission range, and 4) adopting more accurate and realistic analysis to the fast recovery process and showing the dependency of throughput and the risk of experiencing successive fast retransmits and timeouts on the packet error probability. The analytical results are validated against simulation results by using GloMoSim. The results show that the impact of the channel error is reduced significantly due to the packet retransmissions on a per-hop basis and a small bandwidth delay product of ad hoc networks. The TCP throughput always deteriorates less than ~ 10 percent, with a packet error rate ranging from 0 to 0.1. Our model also provides a theoretical basis for designing an optimum long retry limit for IEEE 802.11 in ad hoc networks.     

Steady state and transient state behaviours analyses of TCP connections considering interactions between TCP connections and network

The Internet uses a window‐based congestion control mechanism in transmission control protocol (TCP). In the literature, there have been a great number of analytical studies on TCP. Most of those studies have focused on the statistical behaviour of TCP by assuming a constant packet loss probability in the network. However, the packet loss probability, in reality, changes according to the packet transmission rates from TCP connections. Conversely, the window size of a TCP connection is dependent on the packet loss probability in the network. In this paper, we explicitly model the interaction between the congestion control mechanism of TCP and the network as a feedback system. By using this model, we analyse the steady state and the transient state behaviours of TCP. We derive the throughput and the packet loss probability of TCP, and the number of packets queued in the bottleneck router. We then analyse the transient state behaviour using a control theoretic approach, showing the influence of the number of TCP connections and the propagation delay on the transient state behaviour of TCP. Copyright © 2005 John Wiley & Sons, Ltd.     

Comparative performance analysis of versions of TCP in a localnetwork with a lossy link

We use a stochastic model to study the throughput performance of various transport control protocol (TCP) versions (Tahoe (including its older version that we call OldTahoe), Reno, and NewReno) in the presence of random losses on a wireless link in a local network. We model the cyclic evolution of TCP, each cycle starting at the epoch at which recovery starts from the losses in the previous cycle. TCP throughput is computed as the reward rate in a certain Markov renewal-reward process. Our model allows us to study the performance implications of various protocol features, such as fast retransmit and fast recovery. We show the impact of coarse timeouts. In the local network environment the key issue is to avoid a coarse timeout after a loss occurs. We show the effect of reducing the number of duplicate acknowledgements (ACKs) for triggering a fast retransmit. A large coarse timeout granularity seriously affects the performance of TCP, and the various protocol versions differ in their ability to avoid a coarse timeout when random loss occurs; we quantify these differences. We show that, for large packet-loss probabilities, TCP-Reno performs no better, or worse, than TCP-Tahoe. TCP-NewReno is a considerable improvement over TCP-Tahoe, and reducing the fast-retransmit threshold from three to one yields a large gain in throughput; this is similar to one of the modifications in the TCP-Vegas proposal. We explain some of these observations in terms of the variation of fast-recovery probabilities with packet-loss probability. The results of our analysis compare well with a simulation that uses actual TCP code