Conference Proceeding Article
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.
TCP, multiple, distribution, RED, queues
Software and Cyber-Physical Systems
GLOBECOM 1999: Seamless interconnection for universal services: 5-9 December 1999, Rio de Janeiro, Brazil
City or Country
MISRA, Archan; OTT, Teunis; and BARAS, John.
The Window Behavior of Multiple TCPs with Random Loss Queues. (1999). GLOBECOM 1999: Seamless interconnection for universal services: 5-9 December 1999, Rio de Janeiro, Brazil. 1. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/721
Copyright Owner and License
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.