uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Reducing the TCP Acknowledgment Frequency
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
2007 (English)In: Computer communication review, ISSN 0146-4833, E-ISSN 1943-5819, Vol. 37, no 3, 5-16 p.Article in journal (Refereed) Published
Abstract [en]

Delayed acknowledgments were introduced to conserve net-

work and host resources. Further reduction of the acknowl-

edgment frequency can be motivated in the same way. How-

ever, reducing the dependency on frequent acknowledgments

in TCP is difficult because acknowledgments support reli-

able delivery, loss recovery, clock out new segments, and

serve as input when determining an appropriate sending

rate.

Our results show that in scenarios where there are no ob-

vious advantages of reducing the acknowledgment frequency,

performance can be maintained although fewer acknowledg-

ments are sent. Hence, there is a potential for reducing the

acknowledgment frequency more than is done through de-

layed acknowledgments today. Advancements in TCP loss

recovery is one of the key reasons that the dependence on

frequent acknowledgments has decreased.

We propose and evaluate an end-to-end solution, where

four acknowledgments per send window are sent. The sender

compensates for the reduced acknowledgment frequency us-

ing a form of Appropriate Byte Counting. The proposal also

includes a modification of fast loss recovery to avoid frequent

timeouts.

Place, publisher, year, edition, pages
2007. Vol. 37, no 3, 5-16 p.
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:uu:diva-11021DOI: 10.1145/1273445.1273447ISI: 000248454600003OAI: oai:DiVA.org:uu-11021DiVA: diva2:38789
Available from: 2007-05-11 Created: 2007-05-11 Last updated: 2017-12-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Larzon, Lars-Åke

Search in DiVA

By author/editor
Larzon, Lars-Åke
By organisation
Computer Systems
In the same journal
Computer communication review
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 481 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf