By Topic

A note on an analytic model for slow start in 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

4 Author(s)
Phillips, D. ; Sch. of Comput. Sci. & Inf. Technol., RMIT Univ., Melbourne, Vic., Australia ; Jiankun Hu ; Lloyd-Smith, B. ; Harris, R.

Sikdar et al. [B. Sikdar et al., 2001] has provided a formula to model the window increase pattern given the mechanics of delayed acknowledgements. In this paper, we show that their sum formula significantly underestimates the iterated sum for rounds greater than seven. The approximation error grows exponentially. We also derive a more accurate sum formula whose approximation error is linearly bounded. We show that with use of the incorrect sum formula, cases arise where it is impossible to time out as the initial loss indication in slow start, which can have significant impact on TCP latency, assuming a correlated loss model. We show that our more accurate sum formula greatly reduces the number of cases showing this behaviour, further improving upon the accuracy of the model.

Published in:

Networks, 2003. ICON2003. The 11th IEEE International Conference on

Date of Conference:

28 Sept.-1 Oct. 2003