A faster off-line algorithm for the TCP acknowledgement problem

John Noga, Steve Seiden, Gerhard Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

8 Citations (Scopus)

Abstract

In a recent paper [Proceedings of STOC’98, 1998, pp. 389–398], Dooly, Goldman and Scott study a problem that is motivated by the networking problem of dynamically adjusting delays of acknowledgements in the Transmission Control Protocol (TCP). Among other results, they give an O(n2) off-line algorithm for computing the optimal way of acknowledging n packet arrivals and departures.
In this brief note, we observe that there is a faster off-line algorithm for this problem with time complexity O(n).
Original languageEnglish
Pages (from-to)71-73
JournalInformation processing letters
Volume81
Issue number2
DOIs
Publication statusPublished - 2002
Externally publishedYes

Keywords

  • METIS-208607
  • Transmission Control Protocol
  • TCP acknowledgement
  • Netwerks
  • Dynamic Programming

Fingerprint

Dive into the research topics of 'A faster off-line algorithm for the TCP acknowledgement problem'. Together they form a unique fingerprint.

Cite this