DMCA
The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm (1997)
| Citations: | 652 - 18 self |
BibTeX
@MISC{Mathis97themacroscopic,
author = {Matthew Mathis and Jeffrey Semke and Jamshid Mahdavi and Teunis Ott},
title = {The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm},
year = {1997}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper, we analyze a performance model for the TCP Congestion Avoidance algorithm. The model predicts the bandwidth of a sustained TCP connection subjected to light to moderate packet losses, such as loss caused by network congestion. It assumes that TCP avoids retransmission timeouts and always has sufficient receiver window and sender data. The model predicts the Congestion Avoidance performance of nearly all TCP implementations under restricted conditions and of TCP with SelectiveAcknowledgements over a much wider range of Internet conditions. We verify
Keyphrases
tcp congestion avoidance algorithm macroscopic behavior internet condition network congestion sender data tcp implementation performance model much wider range packet loss sufficient receiver window sustained tcp connection tcp avoids retransmission timeouts congestion avoidance performance
