TFRC与TCP流数之比对协议间公平性影响的研究

简要介绍了TCP Friendly的速率控制（TFRC）协议,通过仿真分析首次研究了TFRC与TCP流数之比对协议间公平性的影响。分析表明：在链路带宽较小时,无论比例如何,TFRC与TCP协议间的公平性都比较差,随着比值增大,协议间公平性得到改善;在链路带宽较大时,无论比例如何,协议间的公平性都较好,但随着比值增大,公平性能下降。     

使用EHN＋机制提高移动网络中TCP性能

TCP协议是一种在因特网上广泛使用的端到端可靠传输协议，移动网络中无线链路的高误码率(BER)和越区切换导致了TCP性能严重降低。在本文中，我们分析了切换过程中TCP遇到的问题，着重考察了TCP从高可用带宽链路切换至低可用带宽链路时遇到的问题，并根据EHN机制提出了EHN 机制，解决了TCP从高可用帝宽链路切换至低可用常宽链路时出现的超时重传导致TCP在切换过程中性能下降的问题，提高了TCP在切换时的可靠性和性能，并给出了模拟结果。     

一种适用于有线-无线混合网络的性能增强代理

为了改善传输控制协议(TCP)在无线网络中的传输性能,提高链路带宽利用率,提出一种适用于有线-无线混合网络环境的性能增强代理( PEP),并在此代理中采用新的流量控制算法.实验结果表明:与标准TCP协议相比,使用此PEP能够显著增加无线链路的带宽利用率,提高TCP在长时延环境下的传输性能.     

SCPS-TP SNACK在卫星网络中的性能分析

由于卫星链路的特性,传统的TCP/IP不能直接应用于卫星网络中.为保证空间链路可靠的端到端数据传输,现已形成了一个标准的空间通信协议SCPS,它是TCP/IP协议的扩展,特别是传输层协议SCPS-TP.分析了SCPS协议体系结构,研究了SCPS-TP技术框架及其采用的SNACK关键技术,并以此关键技术为切入点,仿真研究SCPS-TP的性能及其与TCP协议在吞吐率及链路利用率方面的比较,得出SCPS-TP在宽带、高误码率及大时延通信环境下的性能比TCP要明显优越,更适合于大带宽时延积的卫星通信环境.     

TCPW-REAL：基于无线网络的TCPW改进协议

传统的TCP协议在有线网络中能够良好地工作,但用于无线网络时则性能有所下降.其原因在于,传统的TCP协议无法分辨网络丢包原因,如网络拥塞、链路断开、信道错误或者链路改变.为了提高TCP协议在无线网络中的性能,提出了TCPW-REAL协议,该方案参考了TCPW协议,通过改变其时应答包流的计算方式来时带宽进行更精确的估测.同时,给出了TCPW-REAL的算法并利用仿真对算法进行了验证.分析和仿真结果表明,该方案能够有效地改进TCPW在无线网络的性能.     

基于四元组的链路双向带宽测量方法

为解决网络带宽测量中链路不对称的问题,提出一种能在IP网络中测量出每条链路的双方向带宽的方法.采用由TCP报文和ICMP报文组成的四元组作为探测报文,通过分析各个分组在IP网络中的RTT时延组成,并利用分组大小差值与其往返时廷差值的线性关系计算出链路的双向带宽.仿真实验证明,该方法能快速准确地测量出任意链路的双向带宽.     

TCP Vegas在异构网络环境中的优化研究

研究TCP Vegas和TCP Reno中可用带宽分配均匀性问题。观察在异构网络环境中两种协议的拥塞窗口大小的变化。探讨TCP Vegas在异构网络环境中公平分配可用带宽资源的改进问题,通过NS-2进行仿真,提出改进方案,结果表明方法可行。     

无线自组网络中TCP流公平性的分析与改进

研究了TCP(transmission control protocol)流在多跳无线自组网络中的公平性问题,发现IEEE802.11DCF协议在此环境下会导致严重的不公平性,即部分节点垄断了网络带宽而其他节点被饿死.首先,通过仿真分析了产生TCP流不公平性的原因,指出其根源在于MAC(media access and control)协议的不公平性,同时,TCP的超时机制加剧了不公平性的产生;然后,利用概率模型定量分析了TCP不公平性与MAC协议参数之间的关系,发现TCP流的公平性与TCP报文长度直接相关,并且增加MAC协议初始竞争窗口的大小能够有效提高公平性.据此,提出了一种根据TCP报文长度动态调节初始回退窗口大小的自适应回退MAC协议改进算法.理论分析和仿真表明,该算法在很大程度上可以有效缓解不公平性问题的产生,并且不会引起网络吞吐量的严重降低.     

基于强度控制的并行TCP拥塞控制策略研究

随着网络带宽的不断提升,基于并行TCP的应用方式得到广泛使用。当节点为同一个应用打开多个TCP连接时,对于使用单一TCP连接的网络用户存在严重的不公平。提出一种基于强度控制的并行TCP拥塞控制方案TCP C,使这些TCP流共享拥塞信息,同时限制并行TCP流的有效连接数量,以控制并行流的侵略性。实验结果显示该方案能够较好地保证公平性,同时有效地利用网络带宽。     

基于无线自组织网络的TCP Freeze-Probing改进协议

传统的TCP协议在有线网络中能够良好地工作,但用于无线自组织网络时则性能有所下降.其原因在于,传统的TCP协议无法分辨网络丢包原因,如网络拥塞、链路断开、信道错误或者链路改变.为了提高TCP协议在无线自组织网络中的性能,提出了一种TCP协议的改进方案TCP Freeze-Probing.该方案是一种端到端方法,不需要网络中间节点的反馈合作同时,提出了一种基于TCP Freeze-Probing的吞吐量模型并利用仿真对模型进行了验证.分析和仿真结果表明,该方案能够有效地改进TCP在无线自组织网络的性能.     

Modeling two-windows TCP behavior in differentiated services networks

Two important issues in assured services within differentiated services architecture are bandwidth guarantee and fair sharing of unsubscribed bandwidth among TCP flows with and without bandwidth reservations. Although the subscribed bandwidth can be guaranteed by increasing network capacity or deploying strict admission control mechanisms, the costs of such solutions are very high. The issue of fair sharing of excess bandwidth is also not well solved. To address those issues, a modified TCP, named two-windows TCP, has been proposed. The performance of the protocol is evaluated by simulations. But its effectiveness is not validated theoretically under general network conditions, which is important for understanding the benefits and costs of using the protocol. In this paper, an analytical model is developed for the purpose. The model characterizes throughput of individual two-windows TCP flow as a function of contract rate, round trip time, loss rates of In and Out packets. Extensive simulations validate the analytical model. It's shown two-windows TCP is effective not only on solving the issues of bandwidth guarantee and fair sharing of unsubscribed bandwidth, but also on increasing the utilization of bottleneck link bandwidth. Moreover, its performance is robust to network conditions, which is important for wide deployment over Internet.     

加权轮询算法在TCP非对称网络中的应用及其性能分析

ＴＣＰ是利用接收端返回的确认信息调整发送端数据发送的传输层协议。在非对称信道存在的网络中,当传输确认信息的信道带宽远小于传输数据的信道带宽,确认信息的传输速率小于数据包的传输速率时,ＴＣＰ数据包的传输受到确认信息返回速率的限制。如何在数据包和确认包共享同一个上行信道的情况下,能够既保证上行信道上数据包传输带宽,又不使下行信道上的数据包传输受到抑制是笔者所关心的问题。文章在上行信道采用了一种加权轮询分组调度算法对其数据包和确认包的发送进行控制来解决这一问题,并通过理论分析对该分组调度算法的性能进行分析,最后用仿真验证了对该算法的分析。     

异构无线网络中TCP Vegas算法的研究与改进

异构无线网络是将不同接入技术、不同性能的网络融合到一起构成的单个逻辑网络。异构无线网络中,TCP端到端的拥塞控制机制对网络的健壮性和稳定性具有非常重要的作用,因此是网络研究的一个热点问题。针对异构无线网络中移动节点发生垂直切换时传输层性能下降的特点,提出了一种基于TCP Vegas的传输层拥塞控制算法B-Evegas。给出了垂直切换发生时的传输控制方法,垂直切换后拥塞窗口的恢复采用带宽估计与分段增加策略,并引入了快速恢复机制,在拥塞窗口过大时根据链路的时延指数性地减小拥塞窗口。仿真结果表明,该算法是合理的,可以有效提高垂直切换发生后TCP连接的吞吐量或者减小数据包的传输时延。     

高速网络TCP改进协议NS2仿真性能比较

传统TCP协议在现代高速网络中传输性能存在瓶颈。基于NS2,通过改变瓶颈带宽、往返时延及TCP并行流数等参数,仿真实验了各种TCP改进协议的传输性能,在吞吐率、时延和丢包率等性能指标上对各种协议进行比较。结果表明,多数改进协议在某些方面表现出比传统TCP协议更好的性能,其中采用显式拥塞反馈改进方案的XCP和VCP协议性能表现最好。     

Stability of data networks under an optimization-based bandwidth allocation

It is known that a data network may not be stable at the connection level under some unfair bandwidth allocation policies, even when the normal offered load condition is satisfied, i.e., the average traffic load at each link is less than its capacity. In this note, we show that, under the normal offered load condition, a data network is stable when the bandwidth of the network is allocated so as to maximize a class of general utility functions. Using the microscopic model proposed by Kelly (1997, 2001) for a transmission control protocol (TCP) congestion control algorithm, we argue that the bandwidth allocation in the network dominated by this algorithm can be modeled as our bandwidth allocation model, and hence that the network is stable under the normal offered load condition. This result may shed light on the stability issue of the Internet since the majority of its data traffic is dominated by the TCP.     

Receiver-driven bandwidth sharing for TCP and its application to video streaming

Applications using Transmission Control Protocol (TCP), such as web-browsers, ftp, and various peer-to-peer (P2P) programs, dominate most of the Internet traffic today. In many cases, users have bandwidth-limited last mile connections to the Internet which act as network bottlenecks. Users generally run multiple concurrent networking applications that compete for the scarce bandwidth resource. Standard TCP shares bottleneck link capacity according to connection round-trip time (RTT), and consequently may result in a bandwidth partition which does not necessarily coincide with the user's desires. In this work, we present a receiver-based bandwidth sharing system (BWSS) for allocating the capacity of last-hop access links according to user preferences. Our system does not require modifications to the TCP protocol, network infrastructure or sending hosts, making it easy to deploy. By breaking fairness between flows on the access link, the BWSS can limit the throughput fluctuations of high-priority applications. We utilize the BWSS to perform efficient video streaming over TCP to receivers with bandwidth-limited last mile connections. We demonstrate the effectiveness of our proposed system through Internet experiments.     

基于TCP选项域的信息隐藏算法研究

基于网络协议的信息隐藏技术的研究目的在于利用协议的规范或其实现的漏洞,在普通的网络数据包中嵌入隐藏信息。入侵检测工具Snort对TCP选项域的处理存在漏洞,RFC793对TCP选项域的一些使用限制也过于宽松。针对这些漏洞的设计了两种利用TCP选项域嵌入隐藏信息的信息隐藏算法,这些算法可以逃避Snort的检查;并分析了算法的隐蔽信道带宽,给出了算法的伪代码,并在实际环境中进行了验证。     

基于接收端应用的TCP流量控制策略的研究

传统的TCP拥塞控制和流量控制机制没有考虑不同的数据流之间的竞争导致性能不能满足用户的期望的问题．根据不同类型的数据流的特性，提出了基于接收端应用的TCP流量控制策略，此策略通过改变接收端窗口的大小和确认信息的延时来满足接收端不同应用对带宽的需求．模拟试验表明了此策略是有效可行的．     

Anatomy of UDP and M-VIA for cluster communication

High interprocess communication latency is detrimental to parallel and grid computing. Over the years, the network bandwidth has increased rapidly while the end-to-end latency has not decreased much. This is because the latency is dominated by the protocol software execution time in the kernel instead of the raw transmission time over the link. In this paper, we perform an anatomical analysis of the complete communication path between a sender and a receiver through measurements. We present an in-depth evaluation of various components of the UDP protocol over Fast Ethernet. Virtual Interface Architecture (VIA) protocol has been recently proposed to overcome the software overhead of the TCP/UDP/IP protocol. We analyze M-VIA, a modular VIA implementation for Linux over Ethernet, and compare its performance with UDP. The aim of our experiments is to present the protocol overheads in details rather than to suggest new techniques to reduce overheads.