Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
The Window Distribution Of Multiple Tcps With Random Loss Queues, Archan Misra, Teunis Ott, John Baras
The Window Distribution Of Multiple Tcps With Random Loss Queues, Archan Misra, Teunis Ott, John Baras
Research Collection School Of Computing and Information Systems
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.
The Window Distribution Of Idealized Tcp Congestion Avoidance With Variable Packet Loss, Archan Misra, Teunis J. Ott
The Window Distribution Of Idealized Tcp Congestion Avoidance With Variable Packet Loss, Archan Misra, Teunis J. Ott
Research Collection School Of Computing and Information Systems
This paper analyzes the stationary behavior of the TCP congestion window performing ideal congestion avoidance when the packet loss probability is not constant, but varies as a function of the window size. By neglecting the detailed window behavior during fast recovery, we are able to derive a Markov process that is then approximated by a continuous-time, continuous state space process. The stationary distribution of this process is analyzed and derived numerically and then extrapolated to obtain the stationary distribution of the TCP window. This numerical analysis enables us to predict the behavior of the TCP congestion window when interacting with …