Modeling a new Startup Algorithm for TCP New Reno

Ahmed Yusuf Tambuwal, Raffaello Secchi

Research output: Contribution to journalArticle

7 Downloads (Pure)

Abstract

Standard TCP (New Reno) is vulnerable to
startup effects that cause loss of connection setup packets or
result in long round trip time (RTT) greater than 1-second.
When either of these events occurs, TCP New Reno resets its
congestion state by reducing initial congestion window (IW)
and slow-start threshold (ssthresh) values to 1 and 2
maximum segment size (MSS) respectively. In this condition,
TCP requires multiple round trips to complete delaysensitive
transactions, thus resulting in poor userexperience.
This paper presents a new congestion control
algorithm that makes TCP more responsive by increasing its
robustness against startup losses. Our main contribution in
this paper is derivation of a stochastic model that yields a
simple expression for computing the latency of a short-lived
transaction as a function of IW, ssthresh and bandwidthdelay
product (BDP) of an uncongested link.
Original languageEnglish
Pages (from-to)1-6
Number of pages7
JournalInternational Research Journal of Engineering and Technology
Volume5
Issue number4
Publication statusPublished - Apr 2018

Fingerprint

Stochastic models

Keywords

  • Transmission Control Protocol
  • Congestion Control
  • Startup
  • Responsiveness
  • Interactive Applications

Cite this

Modeling a new Startup Algorithm for TCP New Reno. / Tambuwal, Ahmed Yusuf; Secchi, Raffaello.

In: International Research Journal of Engineering and Technology, Vol. 5, No. 4, 04.2018, p. 1-6.

Research output: Contribution to journalArticle

@article{17424c584a0d408cb33e2bcedeb9bbc8,
title = "Modeling a new Startup Algorithm for TCP New Reno",
abstract = "Standard TCP (New Reno) is vulnerable tostartup effects that cause loss of connection setup packets orresult in long round trip time (RTT) greater than 1-second.When either of these events occurs, TCP New Reno resets itscongestion state by reducing initial congestion window (IW)and slow-start threshold (ssthresh) values to 1 and 2maximum segment size (MSS) respectively. In this condition,TCP requires multiple round trips to complete delaysensitivetransactions, thus resulting in poor userexperience.This paper presents a new congestion controlalgorithm that makes TCP more responsive by increasing itsrobustness against startup losses. Our main contribution inthis paper is derivation of a stochastic model that yields asimple expression for computing the latency of a short-livedtransaction as a function of IW, ssthresh and bandwidthdelayproduct (BDP) of an uncongested link.",
keywords = "Transmission Control Protocol, Congestion Control, Startup, Responsiveness, Interactive Applications",
author = "Tambuwal, {Ahmed Yusuf} and Raffaello Secchi",
year = "2018",
month = "4",
language = "English",
volume = "5",
pages = "1--6",
journal = "International Research Journal of Engineering and Technology",
issn = "2395-0056",
number = "4",

}

TY - JOUR

T1 - Modeling a new Startup Algorithm for TCP New Reno

AU - Tambuwal, Ahmed Yusuf

AU - Secchi, Raffaello

PY - 2018/4

Y1 - 2018/4

N2 - Standard TCP (New Reno) is vulnerable tostartup effects that cause loss of connection setup packets orresult in long round trip time (RTT) greater than 1-second.When either of these events occurs, TCP New Reno resets itscongestion state by reducing initial congestion window (IW)and slow-start threshold (ssthresh) values to 1 and 2maximum segment size (MSS) respectively. In this condition,TCP requires multiple round trips to complete delaysensitivetransactions, thus resulting in poor userexperience.This paper presents a new congestion controlalgorithm that makes TCP more responsive by increasing itsrobustness against startup losses. Our main contribution inthis paper is derivation of a stochastic model that yields asimple expression for computing the latency of a short-livedtransaction as a function of IW, ssthresh and bandwidthdelayproduct (BDP) of an uncongested link.

AB - Standard TCP (New Reno) is vulnerable tostartup effects that cause loss of connection setup packets orresult in long round trip time (RTT) greater than 1-second.When either of these events occurs, TCP New Reno resets itscongestion state by reducing initial congestion window (IW)and slow-start threshold (ssthresh) values to 1 and 2maximum segment size (MSS) respectively. In this condition,TCP requires multiple round trips to complete delaysensitivetransactions, thus resulting in poor userexperience.This paper presents a new congestion controlalgorithm that makes TCP more responsive by increasing itsrobustness against startup losses. Our main contribution inthis paper is derivation of a stochastic model that yields asimple expression for computing the latency of a short-livedtransaction as a function of IW, ssthresh and bandwidthdelayproduct (BDP) of an uncongested link.

KW - Transmission Control Protocol

KW - Congestion Control

KW - Startup

KW - Responsiveness

KW - Interactive Applications

M3 - Article

VL - 5

SP - 1

EP - 6

JO - International Research Journal of Engineering and Technology

JF - International Research Journal of Engineering and Technology

SN - 2395-0056

IS - 4

ER -