A duality model of TCP and queue management algorithms

We propose a duality model of end-to-end congestion control and apply it to understanding the equilibrium properties of TCP and active queue management schemes. The basic idea is to regard source rates as primal variables and congestion measures as dual variables, and congestion control as a distributed primal-dual algorithm over the Internet to maximize aggregate utility subject to capacity constraints. The primal iteration is carried out by TCP algorithms such as Reno or Vegas, and the dual iteration is carried out by queue management algorithms such as DropTail, RED or REM. We present these algorithms and their generalizations, derive their utility functions, and study their interaction

FAST TCP: Motivation, Architecture, Algorithms, Performance

We describe FAST TCP, a new TCP congestion control algorithm for high-speed long-latency networks, from design to implementation. We highlight the approach taken by FAST TCP to address the four difficulties which the current TCP implementation has at large windows. We describe the architecture and summarize some of the algorithms implemented in our prototype. We characterize its equilibrium and stability properties. We evaluate it experimentally in terms of throughput, fairness, stability, and responsiveness

Network coding meets TCP

We propose a mechanism that incorporates network coding into TCP with only minor changes to the protocol stack, thereby allowing incremental deployment. In our scheme, the source transmits random linear combinations of packets currently in the congestion window. At the heart of our scheme is a new interpretation of ACKs - the sink acknowledges every degree of freedom (i.e., a linear combination that reveals one unit of new information) even if it does not reveal an original packet immediately. Such ACKs enable a TCP-like sliding-window approach to network coding. Our scheme has the nice property that packet losses are essentially masked from the congestion control algorithm. Our algorithm therefore reacts to packet drops in a smooth manner, resulting in a novel and effective approach for congestion control over networks involving lossy links such as wireless links. Our experiments show that our algorithm achieves higher throughput compared to TCP in the presence of lossy wireless links. We also establish the soundness and fairness properties of our algorithm.Comment: 9 pages, 9 figures, submitted to IEEE INFOCOM 200

Performance evaluation of TCP-based applications over DVB-RCS DAMA schemes

Transmission Control Protocol (TCP) performance over Digital Video Broadcasting-Return Channel via Satellite (DVB-RCS) standard is greatly affected by the total delay, which is mainly clue to two components, propagation delay and access delay. Both are significant because they are dependent oil the long propagation path of the satellite link. I-lie former is intrinsic and due to radio wave propagation over the satellite channel for both TCP packets and acknowledgements. It is regulated by the control loop that governs TCP. The latter is due to the control loop that governs the demand assignment Multiple access (DAMA) signalling exchange between satellite terminals and the network control center. necessary to manage return link resources. DAMA is adopted in DVB-RCS standard to achieve flexible and efficient use of the shared resources. Therefore, performance of TCP over DVB-RCS may degrade due to the exploitation of two nested control loops also depending oil both file selected DAMA algorithm and the traffic profile. This paper analyses the impact of basic DAMA implementation oil TCP-based applications over a DVB-RCS link for a large Set Of study Cases. To provide a detailed overview of TCP performance in DVB-RCS environment, the analysis includes both theoretical approach and simulation campaign. Copyright (C) 2009 John Wiley & Sons, Ltd

Throughput analysis of TCP congestion control algorithms in a cloud based collaborative virtual environment

Collaborative Virtual Environment (CVE) has become popular in the last few years, this is because CVE is designed to allow geographically distributed users to work together over the network. In CVE the state of the virtual objects is witnessing unprecedentant change. When a user performs an action in CVE, the information of the action needs to be transmitted to other users to maintain consistency in the cooperative work. TCP is the most widely used protocol in the design of CVE, and its throughput deteriorates in the network with large delay. Gital et al, 2014 proposes a cloud based architectural model for improving scalability and consistency in CVE. Therefore, this paper aim at evaluating and comparing the performance of different TCP variant (Tahoe, Reno, New Reno, Vegas, SACK, Fack and Linux) with the cloud based CVE architecture to determine the suitability of each TCP variant for CVE. A comparative analysis between the different TCP variants is presented in terms of throughput verses elapse time, with increasing number of users in the system. TCP with the cloud based model was found to be effective, promising and robust for achieving consistency requirement in CVE system

Simulation based Study of TCP Variants in Hybrid Network

© ASEE 2011Transmission control protocol (TCP) was originally designed for fixed networks to provide the reliability of the data delivery. The improvement of TCP performance was also achieved with different types of networks with introduction of new TCP variants. However, there are still many factors that affect performance of TCP. Mobility is one of the major affects on TCP performance in wireless networks and MANET (Mobile Ad Hoc Network). To determine the best TCP variant from mobility point of view, we simulate some TCP variants in real life scenario. This paper addresses the performance of TCP variants such as TCP-Tahoe, TCP-Reno, TCP-New Reno, TCPVegas, TCP-SACK and TCP-Westwood from mobility point of view. The scenarios presented in this paper are supported by Zone routing Protocol (ZRP) with integration of random waypoint mobility model in MANET area. The scenario shows the speed of walking person to a vehicle and suited particularly for mountainous and deserted areas. On the basis of simulation, we analyze Round trip time (RTT) fairness, End-to-End delay, control overhead, number of broken links during the delivery of data. Finally analyzed parameters help to find out the best TCP variant

End-to-end congestion control protocols for remote programming of robots, using heterogeneous networks: A comparative analysis

There are many interesting aspects of Internet Telerobotics within the network robotics context, such as variable bandwidth and time-delays. Some of these aspects have been treated in the literature from the control point of view. Moreover, only a little work is related to the way Internet protocols can help to minimize the effect of delay and bandwidth fluctuation on network robotics. In this paper, we present the capabilities of TCP, UDP, TCP Las Vegas, TEAR, and Trinomial protocols, when performing a remote experiment within a network robotics application, the UJI Industrial Telelaboratory. Comparative analysis is presented through simulations within the NS2 platform. Results show how these protocols perform in two significant situations within the network robotics context, using heterogeneous wired networks: (1) an asymmetric network when controlling the system through a ADSL connection, and (2) a symmetric network using the system on Campus. Conclusions show a set of characteristics the authors of this paper consider very important when designing an End-to-End Congestion Control transport protocol for Internet Telerobotics

Transfer Control for Resilient End-to-End Transport

Residing between the network layer and the application layer, the transport layer exchanges application data using the services provided by the network. Given the unreliable nature of the underlying network, reliable data transfer has become one of the key requirements for those transport-layer protocols such as TCP. Studying the various mechanisms developed for TCP to increase the correctness of data transmission while fully utilizing the network's bandwidth provides us a strong background for our study and development of our own resilient end-to-end transport protocol. Given this motivation, in this thesis, we study the different TCP's error control and congestion control techniques by simulating them under different network scenarios using ns-3. For error control, we narrow our research to acknowledgement methods such as cumulative ACK - the traditional TCP's way of ACKing, SACK, NAK, and SNACK. The congestion control analysis covers some TCP variants including Tahoe, Reno, NewReno, Vegas, Westwood, Westwood+, and TCP SACK