Publication Type

Conference Proceeding Article

Version

Postprint

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: Seamless interconnection for universal services: 5-9 December 1999, Rio de Janeiro, Brazil

Last Page

1

Edition

13

ISBN

9780780357969

Identifier

10.1109/GLOCOM.1999.832455

Publisher

IEEE

City or Country

Piscataway, NJ

Copyright Owner and License

Authors

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://doi.org/10.1109/GLOCOM.1999.832455

Share

COinS