Modeling a new Startup Algorithm for TCP New Reno

Ahmed Yusuf Tambuwal, Raffaello Secchi

Research output: Contribution to journalArticle

8 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 - 30 Apr 2018

Keywords

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

Fingerprint Dive into the research topics of 'Modeling a new Startup Algorithm for TCP New Reno'. Together they form a unique fingerprint.

  • Cite this