适用于异构网络的改进TCP协议研究

在有线网络中,网络丢包主要是网络拥塞造成的,而传统的TCP协议主要是针对有线网络设计的。对于无线网络,链路错误的随机丢包成为其主要的丢包,传统的TCP已不再适用。为了使TCP适用于有线-无线的异构网络中,提出一种改进的TCP协议(命名为TCP-Ackflag)。此协议通过接收端判断分组数据的相对延迟趋势来判断网络拥塞情况,并在接收端反馈给发送端的ACK包中定义一个拥塞标志位。接收端在接收ACK包中,记录这个拥塞标志位。为了使网络能达到最大吞吐量,发送端只有在发现产生网络丢包现象后再立即对记录的拥塞标志位的值进行检测,通过检测到的拥塞标志位的值来判断网络拥塞情况,最终决定是进入网络拥塞处理过程还是简单地快速重传过程,从而保证了有线-无线异构网络的传输性能。仿真结果表明,此方案对网络拥塞判断准确性和灵敏性都有极大提高,并在此基础上保证了网络传输性能。     

Multiple TFRC Connections Based Rate Control for Wireless Networks

Rate control is an important issue in video streaming applications for both wired and wireless networks. A widely accepted rate control method in wired networks is equation based rate control , in which the TCP friendly rate is determined as a function of packet loss rate, round trip time and packet size. This approach, also known as TCP friendly rate control (TFRC), assumes that packet loss in wired networks is primarily due to congestion, and as such is not applicable to wireless networks in which the bulk of packet loss is due to error at the physical layer. In this paper, we propose multiple TFRC connections as an end-to-end rate control solution for wireless video streaming. We show that this approach not only avoids modifications to the network infrastructure or network protocol, but also results in full utilization of the wireless channel. NS-2 simulations, actual experiments over 1$times$RTT CDMA wireless data network, and and video streaming simulations using traces from the actual experiments, are carried out to validate, and characterize the performance of our proposed approach.     

LIAD: Adaptive bandwidth prediction based Logarithmic Increase Adaptive Decrease for TCP congestion control in heterogeneous wireless networks

For accessing plentiful resources in the Internet through wireless mobile hosts, diverse wireless network standards and technologies have been developed and progressed significantly. The most successful examples include IEEE 802.11 WiFi for wireless networks and 3G/HSDPA/HSUPA for cellular communications. All IP-based applications are the primary motivations to make these networks successful. In TCP/IP transmissions, the TCP congestion control operates well in the wired network, but it is difficult to determine an accurate congestion window in a heterogeneous wireless network that consists of the wired Internet and various types of wireless networks. The primary reason is that TCP connections are impacted by not only networks congestion but also error wireless links. This paper thus proposes a novel adaptive window congestion control (namely Logarithmic Increase Adaptive Decrease, LIAD) for TCP connections in heterogeneous wireless networks. The proposed RTT-based LIAD has the capability to increase throughput while achieving competitive fairness among connections with the same TCP congestion mechanism and supporting friendliness among connections with different TCP congestion control mechanisms. In the Congestion Avoidance (CA) phase, an optimal shrink factor is first proposed for Adaptive Decreasing cwnd rather than a static decreasing mechanism used by most approaches. Second, we adopt a Logarithmic Increase algorithm to increase cwnd while receiving each ACK after causing three duplicate ACKs. The analyses of congestion window and throughput under different packet loss rate are analyzed. Furthermore, the state transition diagram of LIAD is detailed. Numerical results demonstrate that the proposed LIAD outperforms other approaches in goodput, fairness, and friendliness under diverse heterogeneous wireless topologies. Especially, in the case of 10% packet loss rate in wireless links, the proposed approach increases goodput up to 156% and 1136% as compared with LogWestwood+ and NewReno, respectively.     

一种基于带宽估计的无线网拥塞控制机制

针对无线网提出了一种基于带宽估计的拥塞控制机制。该机制利用TCP确认帧携带的数据包到达时间来估算包到达速率，从而得到带宽的估计值。在此基础上用带宽的估计值更新拥塞窗口，避免在发生链路错误时启动拥塞控制机制，由此提高了TCP在无线网上的性能。实验结果表明，算法能减少链路差错对TCP性能带来的影响，提高了TcP在无线网上的吞吐率。     

Improving TCP fairness and performance with bulk transmission control over lossy wireless channel

The traditional windows-based TCP congestion control mechanism produces throughput bias against flows with longer packet roundtrip times; the flow with a short packet roundtrip time preoccupies the shared network bandwidth to a greater extent than others. Moreover, the blind window reduction that occurs whenever packets are lost decreases the network utilization severely, especially in networks with high packet losses. This paper proposes a sender-based TCP congestion control, called TCP-BT. The scheme estimates the network bandwidth depending on the transmission behavior of applications, and adjusts the congestion window by considering both the estimated network bandwidth and the packet roundtrip time to improve fairness as well as transmission performance. The scheme has been implemented in the Linux platform and compared with various TCP variants in real environments. The experimental results show that the proposed scheme 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 practical use of the proposed mechanism.     

A novel self-tuning feedback controller for active queue management supporting TCP flows

Wireless access points act as bridges between wireless and wired networks. Since the actually available bandwidth in wireless networks is much smaller than that in wired networks, there is a bandwidth disparity in channel capacity which makes the access point a significant network congestion point. The recently proposed active queue management (AQM) is an effective method used in wired network and wired-wireless network routers for congestion control, and to achieve a tradeoff between channel utilization and delay. The de facto standard, the random early detection (RED) AQM scheme, and most of its variants use average queue length as a congestion indicator to trigger packet dropping. In this paper, we propose a Novel autonomous Proportional and Differential RED algorithm, called NPD-RED, as an extension of RED. NPD-RED is based on a self-tuning feedback proportional and differential controller, which not only considers the instantaneous queue length at the current time point, but also takes into consideration the ratio of the current differential error signal to the buffer size. Furthermore, we give theoretical analysis of the system stability and give guidelines for the selection of feedback gains for the TCP/RED system to stabilize the instantaneous queue length at a desirable level. Extensive simulations have been conducted with ns2. The simulation results have demonstrated that the proposed NPD-RED algorithm outperforms the existing AQM schemes in terms of average queue length, average throughput, and stability.     

TCP Yuelu:一种基于有线/无线混合网络端到端的拥塞控制机制

无线链路传输数据的比特率出错导致TCP协议在有线／无线混合网络环境下性能低下,在改进算法TCPReno的基础上,文章提出了一种适用于有线／无线混合网络的拥塞控制机制,该机制包括一种分阶段平滑慢启动机制,改善了突发流量对网络性能的损害,引入网络测量技术获得了往返时间（RTT）、网络带宽、瓶颈链路队列长度等网络状态参数,区分网络拥塞和无线链路比特差错,避免了终端节点对网络状态不了解产生的盲目行为,有效改进了TCP的加性增加乘性减少（AIMD）窗口调节机制,提高了网络性能．同时,在仿真软件NS2中实现了该算法,进行了大量的仿真实验,实验结果表明TCP Yuelu有效降低了网络抖动,提高了网络传输性能,并保持了良好的公平性和对其它TCP流的友好性．     

一种丢包区分方法及其在Linux下的实现

针对传统拥塞控制机制在无线链路丢包的情况下出现的盲目降低拥塞窗口、TCP吞吐量下降的问题,研究无线/有线混合环境下基于该机制的一种丢包区分方法——WECN,在Linux操作系统下进行实现。搭建混合网络实验床仿真WECN与TCP Reno, TCP Westwood 2种协议相结合的网络模型。测试结果表明,WECN能扩展到已有的TCP协议中,提高含无线链路网络中TCP的吞吐量。     

加密环境中的无线TCP性能优化

TCP是一种广泛使用的可靠传输协议,它的设计基于拥塞是引起丢包主要原因的假设。但在无线网络中,丢包通常是传输差错的缘故,这导致了TCP传输性能的急剧下降。现有不少无线TCP传输性能优化方法要求中间节点能够获得TCP连接信息,因此不适用于数据流被加密的情况。文中提出的丢包识别机制可应用于加密环境,它通过TCP发送端判断丢包原因并采取相应措施来提高传输速率,仿真结果证明该方法是有效的、鲁棒的,在局域网和广域网环境中都能明显提高TCP端到端传输性能。     

一种提高TCP与UDP数据流公平性的拥塞控制机制

在UDP业务流逐步占据大部分网络带宽的情况下,如何在网络层对UDP包进行拥塞控制显得尤为重要。在网络拥塞时,由于UDP包本身缺乏反馈机制,将会产生严重的丢包或者UDP抢占TCP带宽的现象。文中提出了基于网络层的发送端缓冲队列管理的拥塞控制机制,可以均衡TCP和UDP的带宽使用,同时通过对路由器ICMP网络拥塞报文的处理,建立了高效的流量调节策略,并进行了网络仿真实验。实验结果表明,基于该机制的拥塞控制可以有效改善网络不同业务流带宽使用的不公平性。     

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

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

V2G网络中基于带宽自适应的拥塞控制协议优化

V2G网络下PLC链路带宽受限、高误码率等特点导致现有的TCP NewReno拥塞控制机制缺乏对丢包类型的有效判断,将链路上由噪声干扰的随机错误丢包与网络拥塞丢包统一当做拥塞事件处理,从而造成不必要的拥塞避免,导致了低吞吐量问题.根据此问题,提出了一种基于带宽自适应的拥塞控制算法.该算法通过分组预测拥塞等级感知网络状态,由此估计可用带宽来判断丢包类型,实现了拥塞窗口自适应调节.仿真结果表明该算法在拥塞窗口的增长、吞吐量、公平性、收敛性和友好性等方面都优于现有算法,V2 G网络的吞吐量得到明显提升.     

一种Ad Hoc网络端到端的TCP拥塞控制改进方案

传统的TCP协议是为有线网络而设计的,它假定数据包的丢失是由网络拥塞引起的,然而在Ad Hoc网络中,除拥塞丢包外,其它非拥塞因素也会引起数据包的丢失。分析Ad Hoc网络影响TCP性能的主要因素,在原有拥塞控制方案MMJI的基础上,提出了一种端到端的TCP拥塞控制改进方案（Imp MMJI）。该方案能根据前向路径跳数自适应调整拥塞窗口的大小,防止拥塞窗口过快增长,当发生路由改变或链路中断时,重新计算拥塞窗口cwnd和ssthresh的值,以确保路由重建前后TCP连接负载率的一致性;并在ACK应答包的TCP首部增加了状态标志位,结合多个度量参数联合判断网络状态,提高网络状态识别的准确性,使发送端实时采取相应的措施。仿真结果表明,该方案能使网络吞吐量得到明显的提高,改善了TCP的性能。     

异构网络中保障业务QoS的TCP协议研究

当TCP协议应用于异构网络时业务的QoS无法得到保障,具体而言,一方面TCP协议与无线网络适配性较差,导致网络丢包率升高、吞吐量下降;另一方面,TCP协议对于业务不区分优先级,不能满足高优先级业务的需求。因此,文章提出了异构网络中基于捕食模型的保障业务QoS的TCP协议(QoS - Internet Predator based on Prey Model,Q-IPPM)。Q-IPPM算法不仅会根据异构网络的带宽改进TCP协议的拥塞控制架构,还根据不同业务的负载状况和优先级控制不同业务流量占比。实验结果表明,Q-IPPM算法不仅可以提显著提高异构网络的吞吐量,降低网络丢包率,还能够根据业务优先级和负载状况将带宽“按需分配”给不同业务,从而保障了异构网络中业务的QoS。     

TCP协议在无线网络中的一种改进方法

近年来,无线网络飞速发展,但由于其物理特性的影响,使其不如有线网络那么可靠,无线网络上的丢包率大大高于有线网络.当无线网络中出现丢包后,传统TCP协议会启动其拥塞控制机制,从而造成TCP性能的极大下降.对此提出了一种在传输层上改进wired-cum-wireless网络上TCP协议的方法--WirelessACK响应机制,力图在不改变有线网络的基础上提高TCP的性能.     

基于RS码的网络编码层设计

针对高丢包率的无线网络环境下TCP/IP协议由于其自身缺陷难以提高网络吞吐量的问题,在TCP/IP层次结构中的传输层和网络层之间引入了一个网络编码层。此层在有线网络环境下,对于传输层和网络层来说是透明的,不影响TCP/IP层次结构的功能;在高丢包率的网络环境下,通过编码窗口使用基于RS码的网络编码来提高网络传输吞吐量。网络编码层模型被引入NS2网络仿真软件,仿真结果表明,在高丢包率的网络环境下,此层可提高网络传输吞吐量。     

面向噪声丢包感知的无线网络拥塞算法

针对无线网络链路干扰大、误码率高等特点，以及TCP Westwood算法（TCPW）存在估算带宽时过度依赖包的反馈，缺乏区分传输过程中丢包类型的缺点等问题，提出一种TCPW拥塞控制优化算法--TCPW-F。该算法利用发送速率等构建拥塞因子[F]作为判断丢包类型的依据，同时对判定发生噪声丢包时的拥塞窗口进一步调整，避免噪声丢包引起的窗口下降，提高该情况下窗口的发送效率。仿真结果表明，TCPW-F算法在时延性能方面表现更优，单位时间抖动趋于稳定的速度更快。在同一信道带宽下增大包生成速率，改进算法的实时吞吐量明显高于原算法，具备一定的噪声丢包感知能力，无线网络的TCP传输质量获得较大改善。     

无线网络丢包检测技术的研究

相较于有线网络,无线网络具有误码率高、时延大、带宽低等特性.因此,考虑到TCP直接应用于无线环境的局限性,这方面的研究者们提出了多种TCP拥塞控制的改进机制,这些方案一般没有考虑误码丢包对数据发送速率的影响.本文详细的讨论了有关无线网络丢包检测的各种实施策略,并介绍了若干丢包检测技术的实现原理.     

Learning-TCP: A stochastic approach for efficient update in TCP congestion window in ad hoc wireless networks

In this work, we attempt to improve the performance of TCP over ad hoc wireless networks (AWNs) by using a learning technique from the theory of learning automata. It is well-known that the use of TCP in its present form, for reliable transport over AWNs leads to unnecessary packet losses, thus limiting the achievable throughput. This is mainly due to the aggressive, reactive, and deterministic nature in updating its congestion window. As the AWNs are highly bandwidth constrained, the behavior of TCP leads to high contentions among the packets of the flow, thus causing a high amount of packet loss. This further leads to high power consumption at mobile nodes as the lost packets are recovered via several retransmissions at both TCP and MAC layers. Hence, our proposal, here after called as Learning-TCP, focuses on updating the congestion window in an efficient manner (conservative, proactive, and finer and flexible update in the congestion window) in order to reduce the contentions and congestion, thus improving the performance of TCP in AWNs. The key advantage of Learning-TCP is that, without relying on any network feedback such as explicit congestion and link-failure notifications, it adapts to the changing network conditions and appropriately updates the congestion window by observing the inter-arrival times of TCP acknowledgments. We implemented Learning-TCP in ns-2.28 and Linux kernel 2.6 as well, and evaluated its performance for a wide range of network conditions. In all the studies, we observed that Learning-TCP outperforms TCP-Newreno by showing significant improvement in the goodput and reduction in the packet loss while maintaining higher fairness to the competing flows.     

Achieving high throughput and TCP Reno fairness in delay-based TCP over large networks

The transport control protocol (TCP) has been widely used in wired and wireless Internet applications such as FTP, email and http. Numerous congestion avoidance algorithms have been proposed to improve the performance of TCP in various scenarios, especially for high speed and wireless networks. Although different algorithms may achieve different performance improvements under different network conditions, designing a congestion algorithm that can perform well across a wide spectrum of network conditions remains a great challenge. Delay-based TCP has a potential to overcome above challenges. However, the unfairness problem of delay-based TCP with TCP Reno blocks widely the deployment of delay-based TCP over wide area networks. In this paper, we proposed a novel delay-based congestion control algorithm, named FAST-FIT, which could perform gracefully in both ultra high speed networks and wide area networks, as well as keep graceful fairness with widely deployed TCP Reno hosts. FAST-FIT uses queuing delay as a primary input for controlling TCP congestion window. Packet loss is used as a secondary signal to adaptively adjust parameters of primary control process. Theoretical analysis and experimental results show that the performance of the algorithm is significantly improved as compared to other state-of-the-art algorithms, while maintaining good fairness.