Limit results for Markovian models of TCP
- 13 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1806-1810
- https://doi.org/10.1109/glocom.2001.965887
Abstract
We study in this paper the throughput of a TCP connec- tion performing ideal congestion avoidance. With respect to existing studies published on the same topic, we determine upper and lower bounds for the throughput of a TCP connection experiencing an ar- bitrary constant loss. We then derive exact convergence res ults when the loss probability becomes arbitrarily small. A remarkab le prop- erty of the results obtained in this paper is that they justif y a poste- riori constants, which appear in the approximation of the th roughput and which has been observed earlier via simulation or experiments. The analysis is performed by assuming a finite and infinite max imum congestion window size.Keywords
This publication has 4 references indexed in Scilit:
- 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
- Markov Chains and Stochastic StabilityPublished by Springer Nature ,1993
- Connections with multiple congested gateways in packet-switched networks part 1ACM SIGCOMM Computer Communication Review, 1991