Summary: ANALYSIS of SCALABLE TCP
Eitan Altman, K. Avratchenkov, C. Barakat, A. A. Kherani, and B. J. Prabhu
INRIA Sophia-Antipolis, FRANCE.
faltman, kavrachenkov, cbarakat, alam, firstname.lastname@example.org
Abstract. Scalable TCP  is a proposition for a new TCP where both
the increase and the decrease rate of the window size are multiplicative.
It has been recently proposed in order to improve performance in high
speed networks. In this paper, we present a mathematical analysis of such
multiplicative increase multiplicative decrease protocols in the presence
of random losses. Our approach is based on showing that the logarithm
of the window size evolution has the same behaviour as the workload
process in a standard G/G/1 queue. The Laplace-Stieltjes transform of
the equivalent queue is shown to provide directly the throughput of Scal-
able TCP as well as the higher moments of the window size. We validate
our ndings using ns-2 simulations.
In very high speed networks, the congestion avoidance phase of TCP takes a very
long time to increase the window size and fully utilize the available bandwidth.
Floyd writes in : \for a Standard TCP connection with 1500-byte packets and
a 100 ms round-trip time, achieving a steady-state throughput of 10 Gbps would