ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Performance Evaluation
Volume 65, Issues 6-7, June 2008, Pages 512-530
Innovative Performance Evaluation Methodologies and Tools: Selected Papers from ValueTools 2006
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (836 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.peva.2007.12.006    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2008 Elsevier Ltd All rights reserved.

A stochastic model for the throughput of non-persistent TCP flows

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

François Baccellia, 1, E-mail The Corresponding Author and David R. McDonaldb, Corresponding Author Contact Information, E-mail The Corresponding Author

aINRIA-ENS, France

bINRIA and University of Ottawa, Canada


Received 1 December 2007; 
accepted 7 December 2007. 
Available online 31 December 2007.

Abstract

The general aim of this paper is to analyze the throughput of a HTTP flow. For this, we introduce a simplified model of such a flow which consists of a succession of idle and download periods. The file downloads are subject to a fixed packet loss probability. The same TCP connection is possibly used for the download of a random number of files, for which the effect of the slow start is taken into account. For this stochastic model, we derive a closed form formula for the stationary throughput obtained by a flow. We also derive closed form expressions for the mean time to transfer a file and for the distribution of the throughput. Several laws of file sizes and idle times are considered including heavy tailed distributions. We also briefly discuss how the formulas can be applied to predict bandwidth sharing among competing HTTP flows.

Keywords: Congestion control protocol; Throughput; Additive increase–multiplicative decrease algorithm; TCP; IP traffic; On-off flow; HTTP; Markov process; Ordinary differential equation

Article Outline

1. Introduction
2. Mean values
2.1. Notation
2.2. Throughput
2.3. Latency
2.4. Special cases
2.4.1. Large file sizes
2.4.2. No slow start
2.4.3. No losses
2.5. Heavy tailed case
3. Distribution of the transmission throughput
3.1. Transforms
3.2. Distributions
3.3. The mean throughput of a flow at the end of a file transfer
4. Applications to HTTP throughput prediction
4.1. Slow start parameter estimation
4.1.1. Setting
4.1.2. Slow start jump distribution
4.2. Prediction of bandwidth sharing
4.2.1. The two Regimes
5. Conclusion
Appendix A. Appendix
A.1. Proofs of the results of Section 2
A.2. Proofs of the results of Section 3
A.3. Proofs of the results of Section 4.1.2
References
Vitae












Corresponding Author Contact InformationCorresponding author. Tel.: +1 61356258003505.
1 This work was funded in part by the European NoE EuroNGI.

Performance Evaluation
Volume 65, Issues 6-7, June 2008, Pages 512-530
Innovative Performance Evaluation Methodologies and Tools: Selected Papers from ValueTools 2006
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.