The window distribution of multiple TCPs with random loss queues

Author

Misra, Archan ; Ott, Teunis ; Baras, John

Author_Institution

Telcordia Technol., Morristown, NJ, USA

Volume

3

fYear

1999

fDate

6/21/1905 12:00:00 AM

Firstpage

1714

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

buffer storage; correlation methods; packet switching; queueing theory; random processes; statistical analysis; transport protocols; RED like bottleneck queue; approximate techniques; bottleneck buffer; fixed point algorithm; mean queue length; mean window size; multiple TCP; negatively correlated flows; packet loss probability; queue occupancy; random loss queues; random packet drops; simulation experiments; square root formula; window size distribution; Artificial satellites; Communication networks; Distributed computing; Educational institutions; Internet; Predictive models; Queueing analysis; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1999. GLOBECOM '99

Print_ISBN

0-7803-5796-5

Type

conf

DOI

10.1109/GLOCOM.1999.832455

Filename

832455