The window distribution of multiple TCPs with random loss queues
- 22 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1714-1726
- https://doi.org/10.1109/glocom.1999.832455
Abstract
Two approximate techniques for analyzing the window size distribution of TCP flows sharing a random early detection (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
This publication has 8 references indexed in Scilit:
- Window-based error recovery and flow control with a slow acknowledgement channel: a study of TCP/IP performancePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The window distribution of idealized TCP congestion avoidance with variable packet lossPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Modeling TCP throughputPublished by Association for Computing Machinery (ACM) ,1998
- Comparative performance analysis of versions of TCP in a local network with a lossy linkIEEE/ACM Transactions on Networking, 1998
- The macroscopic behavior of the TCP congestion avoidance algorithmACM SIGCOMM Computer Communication Review, 1997
- Random early detection gateways for congestion avoidanceIEEE/ACM Transactions on Networking, 1993
- Connections with multiple congested gateways in packet-switched networks part 1ACM SIGCOMM Computer Communication Review, 1991
- Congestion avoidance and controlPublished by Association for Computing Machinery (ACM) ,1988