一种提高无线环境中TCP性能的改进方案

本文针对无线信道的特点提出了一种用于提高无线环境中TCP性能的改进方案－Wireless-TCP，通过尝试对TCP的拥塞控制中时间的算法进行调整并增加Probe模块以应对无线信道中的长时间中断，保证TCP连接的存在，通过爱立信通信实验室的仿真实验验证了该改进方案的有效性。     

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

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

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

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

改进半双工链路TCP性能的方法

网络的非对称特性,使TCP协议的性能不仅依赖于正向链路特性和流量特性,而且取决于反向链路特性和流量特性。半双工无线链路没有明显的不对称特性,但由于无法同时发送和接收信息,从而影响TCP协议的性能。本文分析无线网段的半双工特性对TCP协议性能的影响,并给出一种改善措施。     

全IP蜂窝通信系统TCP性能的改进

在无线网络中,造成丢包的主要原因是无线链路的高误码率(BER)及主机在区域间移动。如果TCP的丢包处理简单采用启动拥塞控制机制,势必导致网络传输性能恶化。本文以全IP蜂窝通信系统为例,概述TCP/IP协议组用于无线链路的性能问题,提出解决这些问题的方案,分析该方案的优点和局限性。     

一种支持分级服务和最小带宽保证的改进TCP算法

本文提出了一种支持分级服务和最小带宽保证的改进TCP算法－DSAS－TCP，通过对TCP算中慢启动阈值和最小拥塞窗口的分级设置来使不同等级连接的平均吞吐量产生分级，并保证用户的最小带宽需求。通过理论分析和仿真实验验证了该算法的有效性。     

TCP的发展与改进

TCP是因特网上最通用的传输层协议之一，其核心是拥塞控制机制。文中在介绍TCP基本机制的基础上。对TCP拥塞控制的改进机制进行了讨论，这些改进包括：避免不必要的重传超时、撤销不必要的拥塞控制、显式拥塞通知和数据损伤通知等。     

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

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

改进无线网络TCP性能的研究

对采用TCP协议传输数据的实现过程及其在无线网络中可能遇到的问题进行了描述。对因无线信道误码率较高和频繁切换而导致网络性能下降的问题,提出了无线链路层快速重传技术改善网络性能的有效措施,并研究了在无线网络中链路层快速重传技术对无线TCP数据传输的影响。仿真表明链路层快速重传可以有效地改善无线TCP的性能,进一步提高了网络利用率和吞吐量。     

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

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

TCP拥塞控制机制及性能分析

随着因特网的迅猛发展,因特网中的业务量呈逐年上升趋势,研究了TCP拥塞控制机制及其提供的拥塞控制性能,特别是对TCP连接过程中的数据业务流量与丢失率和其他参数的关系进行了深入的研究。分析表明TCP拥塞控制机制可通过控制注入网络的业务流量,在一定程度下缓解网络拥塞程度,但不能实现数据的有效率的传输。     

An investigation on TCP large initial window

Transport layer implicates a position where satellite networks form one integrated component of hybrid Internet architecture in today's advance technology. However, the Internet has emerged with an important new class of applications that exhibits significant variations of transmission rate over time. Variable‐rate traffic poses a new challenge for transmission control protocol that provides congestion control, especially for applications that need to share the limited capacity of a bottleneck over a long delay Internet path (e.g. paths that include satellite links). Variable‐rate traffic can be produced by persistent transmission control protocol connections and can be impacted by the initial window at the start or during the restart of a session. Current transport research issues are identified related to larger initial window to highlight the expected performance benefits and derive the implications on the design of geostationary satellite Internet systems as the network evolves toward a next‐generation Internet. Copyright © 2013 John Wiley & Sons, Ltd.     

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.     

EVA: a better TCP version for resource‐insufficient networks

TCP Vegas exhibits unfair congestion avoidance mechanism, which aggravates when there are insufficient network resources to accommodate buffer space of a pipe (bandwidth delay product). To remedy this shortcoming, we propose an Enhanced VegAs (EVA) that employs three auxiliary mechanisms: Δ revision, congestion detection and congestion tendency detection. A 2^k factorial design with replications is used to study the effect of the three mechanisms. Our results show that TCP EVA achieves better performance than Vegas under various network conditions. Furthermore, congestion avoidance schemes, such as TCP EVA, perform much better than congestion control schemes, such as TCP Reno, in resource‐insufficient networks. Copyright © 2002 John Wiley & Sons, Ltd.     

TCP拥塞控制技术初探

首先探讨了网络拥塞出现的原因,然后分析了TCP拥塞控制的原理及四个TCP拥塞控制算法的性能,接着着重论述了TCP拥塞控制所面临的问题和对应算法的改进,最后提出了其进一步的研究方向。     

TCP/IP协议的拥塞控制策略

网络拥塞问题会导致网络性能下降,对网络正常运行有很大影响,严重时会导致死锁的产生.文中分析了网络拥塞的产生的原因,并着重讨论了传统端到端的TCP拥塞控制的策略和方法,传统TCP拥塞控制策略提出了改进策略和网络层的IP拥塞控制策略.最后对基于TCP和IP拥塞控制策略进行了对比探讨.     

光突发交换网络的动态TCP特性研究

通过仿真研究了动态业务竞争环境下,不同TCP版本在OBS网络中的传输性能。研究中,以TCP在OBS网络中传送一个固定大小的文件所需的时间作为性能指标,此外,详细分析了突发丢失的内部机制和造成不同TCP版本性能差异的原因。结果表明,TCP SACK性能最好。     

A guaranteed minimum throughput service for TCP flows using measurement‐based admission control

We propose a new scheme for a network service that guarantees a minimum throughput to flows accepted by admission control (AC). The whole scheme only uses a small set of packet classes in a core‐stateless network. At the ingress of the network each flow packet is marked into one of the sets of classes, and within the network, each class is assigned a different discarding priority. The AC method is based on edge‐to‐edge per‐flow throughput measurements using the first packets of the flow, and it requires flows to send with a minimum rate. We evaluate the scheme through simulations in a simple bottleneck topology with different traffic loads consisting of TCP flows that carry files of varying sizes. We use a modified TCP source with a new algorithm that forces the source to send with a minimum rate. We compare our scheme with the best‐effort service and we study the influence of the measurement duration on the scheme's performance. The results prove that the scheme guarantees the requested throughput to accepted flows and achieves a high utilization of network resources. Copyright © 2006 John Wiley & Sons, Ltd.