By Topic

Stochastic Analysis of Scalable TCP

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Baccelli, F. ; INRIA & Ecole Normale Super., Paris ; Carofiglio, G. ; Piancino, M.

The unsatisfactory performance of TCP in high speed wide area networks has led to several versions of TCP- like H-TCP, Fast TCP, Scalable TCP, Compound or CUBIC, all aimed at speeding up the window update algorithm. In this paper we focus on Scalable TCP (STCP), a TCP version which belongs to the class of Multiplicative Increase Multiplicative Decrease (MIMD) congestion protocols. We present a new stochastic model for the evolution of the instantaneous throughput of a single STCP flow in the Congestion Avoidance phase, under the assumption of a constant per-packet loss probability. This model allows one to derive several closed-form expressions for the key stationary distributions associated with this protocol: we characterize the throughput obtained by the flow, the time separating Multiplicative Decrease events, the number of bits transmitted over certain time intervals and the size of rate decrease. Several applications leveraging these closed form expressions are considered with a particular emphasis on QoS guarantees in the context of dimensioning. A set of ns2 simulations highlights the model accuracy.

Published in:

INFOCOM 2009, IEEE

Date of Conference:

19-25 April 2009