TCP model for short lived flows

We propose a recursive, analytical model to predict the TCP performance in terms of completion time for short lived flows. Based on the knowledge of the average dropping probability, the average roundtrip time and the flow length, the model provides very good results when compared to simulation     

Cross-layer loss differentiation algorithms to improve TCP performance in WLANs

Loss Differentiation Algorithms (LDA) are currently used to determine the cause of packet losses with an aim of improving TCP performance over wireless networks. In this work, we propose a cross-layer solution using two complementary LDA schemes in order to classify the loss origin on an 802.11 link and then to react consequently. The first LDA scheme, acting at the MAC layer, allows differentiating losses due to signal failure caused by displacement or by noise from other loss types. Moreover, in the case of a signal failure, this scheme adapts the behavior of the MAC layer in order to avoid a costly end-to-end TCP resolution. The objective of the second LDA scheme, which acts at the TCP layer, is to distinguish between losses due to interferences and those due to congestions, then accordingly adapt the TCP behavior. We finally demonstrate, through simulation, the efficiency of each LDA scheme as well as the whole cross-layer solution.     

WLAN中TCP性能改进的跨层方案仿真

随着无线网络的迅速发展,如何改进TCP在无线网络中的传输性能这一课题,已经成为国内外研究的热点.文章分析了现有的几种典型的TCP改进方案,并在此基础上介绍一种新的跨层方案.通过在传输层和链路层之间引入ARQ Snoop代理,在链路层检测并重传ARQ分组的同时,协调WLAN MAC子层的ARQ机制与TCP的ARQ策略.     

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

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

"De-Randomizing" congestion losses to improve TCP performance over wired-wireless networks

Currently, a TCP sender considers all losses as congestion signals and reacts to them by throttling its sending rate. With Internet becoming more heterogeneous with more and more wireless error-prone links, a TCP connection may unduly throttle its sending rate and experience poor performance over paths experiencing random losses unrelated to congestion. The problem of distinguishing congestion losses from random losses is particularly hard when congestion is light: congestion losses themselves appear to be random. The key idea is to "de-randomize" congestion losses. This paper proposes a simple biased queue management scheme that "de-randomizes" congestion losses and enables a TCP receiver to diagnose accurately the cause of a loss and inform the TCP sender to react appropriately. Bounds on the accuracy of distinguishing wireless losses and congestion losses are analytically established and validated through simulations. Congestion losses are identified with an accuracy higher than 95% while wireless losses are identified with an accuracy higher than 75%. A closed form is derived for the achievable improvement by TCP endowed with a discriminator with a given accuracy. Simulations confirm this closed form. TCP-Casablanca, a TCP-Newreno endowed with the proposed discriminator at the receiver, yields through simulations an improvement of more than 100% on paths with low levels of congestion and about 1% random wireless packet loss rates. TCP-Ifrane, a sender-based TCP-Casablanca yields encouraging performance improvement.     

Using path prediction to improve TCP performance in wireless/mobile communications

The operation of TCP in wireless mobile environments is discussed. After presenting previous efforts to ameliorate TCP performance in the considered environments, we propose a new mechanism for tackling the transmission slowdown problems caused by handovers. Our proposal is based on stochastic datagram relocation. Traffic destined to the mobile terminal is tunneled to and cached into adjacent cells according to the output of a path prediction algorithm. To reduce the associated overhead, only percentages of inbound traffic are copied to the cell's neighborhood on the basis of estimated probabilities. The time scheduling for datagram relocation is also taken into account. Simulations of the proposed architecture show substantial performance improvements for TCP traffic.     

Applications of network coding to improve TCP performance over wireless mesh networks: a survey

There is growing interest in the use of wireless mesh network (WMN) as a last‐mile option for Internet access. Despite the many benefits of WMNs, the performance of Internet access may not be ideal. One of the main issues is the interaction of transmission control protocol (TCP) with the underlying network. The poor performance of TCP over multi‐hop networks is well‐documented, and extensive research exists, which addresses TCPs foible and enhance TCP performance for multi‐hop environments. This paper provides a thorough survey of TCP performance issues over WMNs and the available solutions to address these issues. Among the existing methods, we focused on network coding (NC) and the ways that TCP interacts with network coded systems. NC is a technique that encodes the received packets in each node before forwarding them towards the destination. The use of NC in the transport layer to address performance issues raised by wireless access is a recent research topic. This paper presents a detailed study of TCP interaction with NC. Some open research areas in this field are suggested. Copyright © 2012 John Wiley & Sons, Ltd.     

基于RTT的TCP流带宽公平性保障机制

TCP端到端的拥塞控制机制使得TCP连接获得的瓶颈带宽反比于RTT(数据包往返时间)。为了缓解TCP对于RTT较小流的偏向,区分服务的流量调节机制在RTT较小的流取得目标速率且获得多余资源的情况下可以确保RTT较大流不至于饥饿。现有的基于RTT的流量调节机制在网络拥塞程度较轻时非常有效,但是当网络拥塞程度较重时,由于对RTT较大流的过分保护而导致RTT较小流饥饿。因此,通过引进自适应的思想提出了改进方法,其主要思想就是根据网络的拥塞程度自适应地调整对RTT较大流的保护程度。大量的仿真试验表明所提的机制能有效保障TCP流的带宽公平性并且比现有的方法具有更好的强壮性。     

Relative loss rate differentiation: performance of short‐lived TCP flows

The relative differentiated service model provides assurances for the relative quality ordering between service classes, rather than for the actual service level in each class. In this paper, we describe a relative loss rate differentiation scheme where packet drop probabilities are determined according to an active queue management (AQM) mechanism based on random early detection (RED) in a first‐in first‐out (FIFO) queue, are weighted in inverse proportion to the price that the network operator assigns to each service class. Basically, we describe a scheme where relative loss rate differentiation is incorporated directly into AQM. Most TCP flows today, particularly Web flows, can be characterized as short‐lived flows. Using simulations with short‐lived TCP flows, we show that the scheme is very effective in ensuring relative loss rate differentiation between service classes during times of network congestion. Copyright © 2004 John Wiley & Sons, Ltd.     

Delayed duplicate acknowledgements: a TCP‐Unaware approach to improve performance of TCP over wireless

Since a TCP sender cannot distinguish between packet losses arising from transmission errors from those due to congestion, TCP tends to perform poorly on wireless links that are prone to transmission errors. Several techniques have previously been proposed to improve TCP performance over wireless links. Existing schemes typically require an intermediate node (typically, a base station) to be TCP‐aware. For instance, the Snoop scheme requires the base station to interpret TCP headers and take appropriate action to help improve TCP performance. This paper proposes an alternative TCP‐unaware technique that attempts to mimic the behavior of the Snoop protocol. Performance evaluation shows that the proposed Delayed Dupacks scheme performs quite well. Copyright © 2001 John Wiley & Sons, Ltd.     

Analysis and stochastic characterization of TCP flows

Since the most Internet services use TCP as a transport protocol there is a growing interest in the characterization of TCP flows. However, the flow characteristics depend on a large number of factors, due to the complexity of the TCP. As a result, the TCP characteristics are normally studied by means of simulations or controlled network setups. In this paper we propose a TCP characterization based on a generic model based of stochastic flow with burstiness and throughput ((σ,ρ)-constrains), which is useful in order to characterize flows in atm and other flow-switched networks. The model is obtained through extensive analysis of a real traffic trace, comprising an approximate number of 1,500 hosts and 1,700,000 TCP connections. The results suggest that TCP connections in the wide area Internet have low throughput while the packet bursts do not suffer an exponential increase, as indicated by the slow-start behavior. On the other hand, the impact of the connection establishment phase is striking. We note that the throughput of the TCP flow is approximately half the throughput which is obtained in the data transfer phase, namely after the connection has been established.     

提高全局资源调度和本地资源调度的效能的云计算资源调度方案分析

设计分析可以提高当前全局资源调度、本地资源调度效能的云计算资源调度方案。在云计算资源调度中,能够优化分析,提高全局资源调度和本地资源调度的效能的调度方案,分析调度方案设计需求,设计实现提升云计算资源调度效能。结果证实,在云计算资源调度方案设计中,确保提高全局资源调度和本地资源调度的效能,全局资源调度效能提高20%,提高本地资源调度效能达到32%,发挥积极影响。结论表达出在进行云计算资源调度方案设计中,优化设计其全局资源调度、本地资源调度,可以提升资源调度效能,有助于提升云计算资源调度方案质量,发挥实用价值。     

PD-RED: to improve the performance of RED

We propose a new active queue management (AQM) scheme to improve the performance of the well-known random early detection (RED) AQM. The new AQM is based on the proportional derivative (PD) control principle, and we call it PD-RED. In PD-RED we introduce minimal changes to RED. We demonstrate the improvement in performance of PD-RED over adaptive RED AQM by simulations.     

Modbus/TCP协议事务调度的研究

介绍Modbus/TCP协议的事务处理模式在SCADA采集子系统中的应用,分析多事务调度的采集方式.研究表明,采用多事务异步调用技术的SCADA采集子系统具有较高的采集率,能够保证系统高效稳定运行.     

Average-value analysis of 802.11 WLANs with persistent TCP flows

In this letter we develop an average-value analysis of the TCP performance in 802.11 WLANs. Our model characterizes the equilibrium conditions of the network, and this method yields a simple, yet precise, estimate of the throughput obtained by persistent TCP flows. Via simulations we study the accuracy of the model predictions.     

Asymptotic behavior of heterogeneous TCP flows and RED gateway

We introduce a stochastic model of a bottleneck ECN/RED gateway under a large number of heterogeneous TCP flows, i.e., flows with diverse round-trip delays and session dynamics. We investigate the asymptotic behavior of the system and show that as the number of flows becomes large, the buffer dynamics and aggregate traffic simplify and can be accurately described by simple stochastic recursions independent of the number of flows, resulting in a scalable model. Based on the Central Limit analysis in the paper, we identify the sources of fluctuations in queue size and describe the relationship between the system parameters such as the marking function and variance of queue size. A closed-form approximation for the mean queue size as a function of system parameters is provided from a simple steady-state analysis. Numerical examples are provided to validate our results.     

Time-shift scheduling-fair scheduling of flows in high-speednetworks

We present a scheduling protocol, called time-shift scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a predetermined packet rate and an upper bound on packet delay. The protocol is an improvement over existing protocols because it satisfies the properties of rate-proportional delay, fairness, and efficiency, while existing protocols fail to satisfy at least one of these properties. In time-shift scheduling each flow is assigned an increasing timestamp, and the packet chosen for transmission is taken from the flow with the least timestamp. The protocol features the novel technique of time shifting, in which the scheduler's real-time clock is adjusted to prevent flow timestamps from increasing faster than the real-time clock. This bounds the difference between any pair of flow timestamps, thus ensuring the fair scheduling of flows     

Providing differentiated service to TCP flows over bandwidth on demand geostationary satellite networks

The elasticity of transmission control protocol (TCP) traffic complicates attempts to provide performance guarantees to TCP flows. The existence of different types of networks and environments on the connections' paths only aggravates this problem. In this paper, simulation is the primary means for investigating the specific problem in the context of bandwidth on demand (BoD) geostationary satellite networks. Proposed transport-layer options and mechanisms for TCP performance enhancement, studied in the single connection case or without taking into account the media access control (MAC)-shared nature of the satellite link, are evaluated within a BoD-aware satellite simulation environment. Available capabilities at MAC layer, enabling the provision of differentiated service to TCP flows, are demonstrated and the conditions under which they perform efficiently are investigated. The BoD scheduling algorithm and the policy regarding spare capacity distribution are two MAC-layer mechanisms that appear to be complementary in this context; the former is effective at high levels of traffic load, whereas the latter drives the differentiation at low traffic load. When coupled with transport layer mechanisms they can form distinct bearer services over the satellite network that increase the differentiation robustness against the TCP bias against connections with long round-trip times. We also explore the use of analytical, fixed-point methods to predict the performance at transport level and link level. The applicability of the approach is mainly limited by the lack of analytical models accounting for prioritization mechanisms at the MAC layer and the nonuniform distribution of traffic load among satellite terminals.     

一种利用时序调度提高蓝牙链路可靠性的方法

介绍一种基于蓝牙LMP(链路管理协议)的时序调度方案．它通过不使用被干扰恶化的频点传输数据．达到提高链路性能的目的．利用蓝牙协议中预留的消息字．无需改动硬件．简便易行。