Publication Type
Conference Proceeding Article
Version
submittedVersion
Publication Date
12-1999
Abstract
Two approximate techniques for analyzing the window size distribution of TCP flows sharing a RED-like bottleneck queue are presented. Both methods presented first use a fixed point algorithm to obtain the mean window sizes of the flows, and the mean queue length in the bottleneck buffer. The simpler of the two methods then uses the ‘square root formula’ for TCP; the other method is more complicated. More often than not, the simpler method is slightly more accurate; this is probably due to the fact that window sizes of the different flows are negatively correlated.
Keywords
TCP, multiple, distribution, RED, queues
Discipline
Software Engineering
Research Areas
Software and Cyber-Physical Systems
Publication
GLOBECOM 1999: Global Telecommunications Conference, 5-9 December 1999, Rio de Janeiro, Brazil: Proceedings
First Page
1714
Last Page
1726
ISBN
9780780357969
Identifier
10.1109/GLOCOM.1999.832455
Publisher
IEEE
City or Country
Piscataway, NJ
Citation
MISRA, Archan; OTT, Teunis; and BARAS, John.
The window distribution of multiple TCPs with random loss queues. (1999). GLOBECOM 1999: Global Telecommunications Conference, 5-9 December 1999, Rio de Janeiro, Brazil: Proceedings. 1714-1726.
Available at: https://ink.library.smu.edu.sg/sis_research/721
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1109/GLOCOM.1999.832455