Transport congestion events detection (TCED): towards decorrelating congestion detection from TCP

TCP (Transmission Control Protocol) uses a loss-based algorithm to estimate whether the network is congested or not. The main difficulty for this algorithm is to distinguish spurious from real network congestion events. Other research studies have proposed to enhance the reliability of this congestion estimation by modifying the internal TCP algorithm. In this paper, we propose an original congestion event algorithm implemented independently of the TCP source code. Basically, we propose a modular architecture to implement a congestion event detection algorithm to cope with the increasing complexity of the TCP code and we use it to understand why some spurious congestion events might not be detected in some complex cases. We show that our proposal is able to increase the reliability of TCP NewReno congestion detection algorithm that might help to the design of detection criterion independent of the TCP code. We find out that solutions based only on RTT (Round-Trip Time) estimation are not accurate enough to cover all existing cases. Furthermore, we evaluate our algorithm with and without network reordering where other inaccuracies, not previously identified, occur

A Survey on Congestion Control Protocols for CoAP

The Internet of things (IoT) comprises things interconnected through the internet with unique identities. Congestion management is one of the most challenging tasks in networks. The Constrained Application Protocol (CoAP) is a low-footprint protocol designed for IoT networks and has been defined by IETF. In IoT networks, CoAP nodes have limited network and battery resources. The CoAP standard has an exponential backoff congestion control mechanism. This backoff mechanism may not be adequate for all IoT applications. The characteristics of each IoT application would be different. Further, the events such as unnecessary retransmissions and packet collision caused due to links with high losses and packet transmission errors may lead to network congestion. Various congestion handling algorithms for CoAP have been defined to enrich the performance of IoT applications. Our paper presents a comprehensive survey on the evolution of the congestion control mechanism used in IoT networks. We have classified the protocols into RTO-based, queue-monitoring, and rate-based. We review congestion avoidance protocols for CoAP networks and discuss directions for future work

On detection algorithms for spurious retransmissions in TCP

In TCP, a spurious packet retransmission can be caused by either spurious timeout (STO) or spurious fast retransmit (SFR). The "lost" packets are unnecessarily retransmitted and the evoked congestion control process causes network underutilization. In this paper, we focus on spurious retransmission detection. We first present a survey on some important and interesting spurious retransmission detection algorithms. Based on the insights obtained, we propose a novel yet simple detection algorithm called split-and-retransmit (SnR). SnR only requires a minor modification to the TCP sender while leaving the receiver intact. The key idea is to split the retransmitted packet into two smaller ones before retransmitting them. As the packet size is different, the ACK triggered will carry different ACK numbers. This allows the sender to easily distinguish between the original transmission and the retransmission of a packet without relying on, e.g., TCP options. We then compare our SnR with STODER, F-RTO and Newreno under both loss-free and lossy network environments. We show that our SnR is resilient to packet loss and yields good performance under various simulation settings. ©2010 IEEE.published_or_final_versionThe 2010 IEEE Wireless Communications and Networking Conference (WCNC), Sydney, Australia, 18-21 April 2010. In Proceedings of WCNC, 2010, p. 1-

Making TCP More Robust to Long Connectivity Disruptions (TCP-LCD)

Disruptions in end-to-end path connectivity, which last longer than one retransmission timeout, cause suboptimal TCP performance. The reason for this performance degradation is that TCP interprets segment loss induced by long connectivity disruptions as a sign of congestion, resulting in repeated retransmission timer backoffs. This, in turn, leads to a delayed detection of the re-establishment of the connection since TCP waits for the next retransmission timeout before it attempts a retransmission. This document proposes an algorithm to make TCP more robust to long connectivity disruptions (TCP-LCD). It describes how standard ICMP messages can be exploited during timeout-based loss recovery to disambiguate true congestion loss from non-congestion loss caused by connectivity disruptions. Moreover, a reversion strategy of the retransmission timer is specified that enables a more prompt detection of whether or not the connectivity to a previously disconnected peer node has been restored. TCP-LCD is a TCP senderonly modification that effectively improves TCP performance in the case of connectivity disruptions. Status of This Memo This document is not an Internet Standards Track specification; it is published for examination, experimental implementation, and evaluation. This document defines an Experimental Protocol for the Internet community. This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Not all documents approved by the IESG are a candidate for any level of Internet Standard; see Section 2 of RFC 5741. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained a

Investigations on making TCP robust against spurious retransmissions

Master'sMASTER OF SCIENC

An improved eifel algorithm for TCP over wireless links

Master'sMASTER OF SCIENC

TCP Performance in Heterogeneous Wireless Networks

The TCP protocol is used by most Internet applications today, including the recent mobile wireless terminals that use TCP for their World-Wide Web, E-mail and other traffic. The recent wireless network technologies, such as GPRS, are known to cause delay spikes in packet transfer. This causes unnecessary TCP retransmission timeouts. This dissertation proposes a mechanism, Forward RTO-Recovery (F-RTO) for detecting the unnecessary TCP retransmission timeouts and thus allow TCP to take appropriate follow-up actions. We analyze a Linux F-RTO implementation in various network scenarios and investigate different alternatives to the basic algorithm. The second part of this dissertation is focused on quickly adapting the TCP's transmission rate when the underlying link characteristics change suddenly. This can happen, for example, due to vertical hand-offs between GPRS and WLAN wireless technologies. We investigate the Quick-Start algorithm that, in collaboration with the network routers, aims to quickly probe the available bandwidth on a network path, and allow TCP's congestion control algorithms to use that information. By extensive simulations we study the different router algorithms and parameters for Quick-Start, and discuss the challenges Quick-Start faces in the current Internet. We also study the performance of Quick-Start when applied to vertical hand-offs between different wireless link technologies.Suurin osa Internet-sovelluksista käyttää TCP-protokollaa turvatakseen luotettavan tiedonvaihdon. Tällaisia sovelluksia ovat esimerkiksi WWW, sähköposti, ja monet pikaviestiohjelmat. TCP-protokollan pääpiirteet on suunniteltu 1970- ja 1980-luvulla, jolloin päätelaitteita ja sovelluksia oli huomattavasti nykyistä vähemmän ja yhteydet pohjautuivat kiinteiden kommunikaatiolinkkien käyttöön. Langattomien päätelaitteiden yleistyessä on huomattu, että TCP-protokollan suorituskyky ei aina ole hyväksyttävällä tasolla, koska monet sen piirteistä on alunperin suunniteltu erilaisessa käyttöympäristössä. Väitöstyö perehtyy langattoman linkin aiheuttamien vaikeasti ennustettavien viiveiden vaikutukseen TCP:n suorituskyvylle. Tällainen käyttäytyminen on ominaista esimerkiksi nykyisin laajalti matkapuhelimissa käytetylle GPRS-teknologialle. Yllättävät viiveet datansiirrossa aiheuttavat TCP:n uudelleenlähetysajastimen tarpeettoman laukeamisen. Tämä aiheuttaa useiden pakettien turhan uudelleenlähetyksen ja vaikeuttaa TCP:n ruuhkanvalvonta-algoritmien toimintaa. Väitöstyössä ehdotetaan F-RTO -nimistä parannusta TCP:n uudelleenlähetysalgoritmeihin, joka pyrkii havaitsemaan turhat uudelleenlähetykset ja välttämään edellä mainitut ongelmat tällaisissa tilanteissa. Väitöstyö analysoi F-RTO:n suorituskykyä erilaisissa kommunikaatioskenaarioissa ja tutkii erilaisia variaatioita perusalgoritmiin. Lisäksi väitöskirjassa tutkitaan TCP:n lähetysnopeuden pikaista sopeuttamista vallitseville siirto-olosuhteille. Normaalisti TCP tarvitsee huomattavan ajan löytääkseen oikean siirtonopeuden yhteyden alussa, mikäli siirtolinkki on erityisen nopea ja siirtoviiveet verraten pitkiä. Tämä on tilanne uusimmissa langattomissa kommunikaatioteknologioissa. Samankaltainen ongelma esiintyy myös, mikäli TCP-yhteys vaihtaa käyttämäänsä siirtoteknologiaa kesken yhteyden esimerkiksi liikkuvuuden seurauksena. Tämä voi tapahtua uusimmissa päätelaitteissa, jotka tukevat useita erityyppisiä radioteknologioita, kuten WLAN ja GPRS. Väitöskirjassa tutkitaan Quick-Start - nimistä mekanismia, joka nopeuttaa huomattavasti TCP:n sopeutumisnopeutta edellä mainitun kaltaisissa tilanteissa. Työssä tarkastellaan erilaisia algoritmeja Quick-Startin käyttöön ja analysoidaan simulointien avulla algoritmien toimintaa erilaisissa ympäristöissä. Väitöstyössä esitetyillä tuloksilla Internet-kommunikaation suorituskykyä ja käytettävyyttä langattomilla laitteilla voidaan parantaa huomattavasti