Article

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

Authors:

François Baccelli,

David R. McDonaldAuthors Info & Claims

valuetools '06: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools

Pages 58 - es

https://doi.org/10.1145/1190095.1190169

Published: 11 October 2006 Publication History

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.

References

[1]

http://lists.w3.org/Archives/Public/ietf-http-wg-old/2000SepDec/0078.html

[2]

http://www.faqs.org/rfcs/rfc2581.html

[3]

Aweya J., Ouellette, M., Montuno, D. Y. (2002) DRED: a random early detection algorithm for TCP/IP networks International Journal of Communication Systems, 15, p. 287--307.

[4]

Ayesta, U., Avrachenkov, K., Altman, E., Barakat, C., Dube, P. (2003) Multilevel Approach for Modeling Short TCP Sessions. Proceedings of ITC-18, Berlin, September.

[5]

Baccelli, Kim, K. B., F., McDonald (2005) Equilibria of a Class of Transport Equations Arising in Congestion Control. INRIA Report 5653, to appear in QUESTA.

[6]

Baccelli, F., McDonald (2005) A Square Root Formula for the Rate of Non-Persistent TCP Flows. Proceedings of the firts EuroNGI Conference, Rome April 2005.

[7]

Baccelli, F., McDonald, D. R., Reynier, J. (2002) A mean-field model for multiple TCP connections through a buffer implementing RED. Performance Evaluation Vol. 11, (2002) pp. 77--97. Elsevier Science.

Digital Library

[8]

Baccelli, F., Chaintreau, A., De Vleeschauwer, D., McDonald, D. (2004). A mean-field analysis of short lived interacting TCP flows. In Proceedings of ACM Sigmetrics'04, June 2004, New York.

Digital Library

[9]

Chang, C.-S., Liu, Z. (2002) A Bandwidth Sharing Theory for a Large Number of HTTP-like Connections. In Proceedings of the IEEE Infocom 2002 Conference, New York, June 2002.

[10]

Flajolet, P., Sedgewick, R. (1996) The Average Case Analysis of Algorithms: Mellin Transform Analysis, Inria Report Number 2956.

[11]

Floyd, S., Jacobson, V. (1993) Random early detection gateways for congestion avoidance IEEE/ACM Trans. Networking, No.4, 397--413.

Digital Library

[12]

Fred, S., Bonald, T., Proutière, A., Régnié, G., Roberts, J. (2001) Statistical bandwidth sharing: a study of congestion at flow level. in Proceedings of ACM SIGCOMM 2001: pp111--122

Digital Library

[13]

Heyman, D., Lakshman, T., Neidhardt, A. (1997) A new method for analyzing feedback-based protocols with applications to engineering web traffic over the Internet. in ACM Sigmetrics, pp. 24--38.

Digital Library

[14]

Kherani, A. A., Kumar, A. (2000) Performance Analysis of TCP with Non-persistent Sessions. Workshop on Modeling of Flow and Congestion Control, INRIA, Ecole Normale Supérieure, Paris, September 4-6, 2000.

[15]

Knuth, D. (1997) The Art of Computer Programming, Addison Wesley.

Digital Library

[16]

Ott, T., Kemperman, J. H. B., Mathis, M. (1992) The Stationary Behavior of Ideal TCP Congestion Avoidance. Internetworking: Research and Experience, V.11, p.115--156.

[17]

Roberts, J., Massoulié, L. (1998) Bandwidth sharing and admission control for elastic traffic. ITC Specialist Seminar, Yokohama, October.

[18]

B. Sikdar, B., Kalyanaraman S., Vastola, K. S. (2001) An Integrated Model for the Latency and Steady-State Throughput of TCP Connections. Performance Evaluation, v.46, no.2-3, pp.139--154, September.

Digital Library

Cited By

Osipova N(2019)Batch processor sharing with hyper-exponential service timeOperations Research Letters10.1016/j.orl.2007.11.00336:3(372-376)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1016/j.orl.2007.11.003
Yoshida HSatoda KMurase T(2013)Constructing stochastic model of TCP throughput on basis of stationarity analysis2013 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2013.6831293(1544-1550)Online publication date: Dec-2013
https://doi.org/10.1109/GLOCOM.2013.6831293
Loiseau PGonçalves PBarral JVicat-Blanc Primet P(2010)Modeling TCP throughputPerformance Evaluation10.1016/j.peva.2010.08.01667:11(1030-1043)Online publication date: 1-Nov-2010
https://dl.acm.org/doi/10.1016/j.peva.2010.08.016
Show More Cited By

Index Terms

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

Recommendations

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

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 ...
Modeling the throughput of TCP Vegas
SIGMETRICS '03: Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Previous analytic models of TCP Vegas throughput have been developed for loss-free (all-Vegas) networks. This work develops a simple and accurate analytic model for the throughput of a TCP Vegas bulk transfer in the presence of packet loss, as a ...
Modeling the throughput of TCP Vegas

Previous analytic models of TCP Vegas throughput have been developed for loss-free (all-Vegas) networks. This work develops a simple and accurate analytic model for the throughput of a TCP Vegas bulk transfer in the presence of packet loss, as a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

valuetools '06: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools

October 2006

638 pages

ISBN:1595935045

DOI:10.1145/1190095

General Chairs:
Luciano Lenzini
University of Pisa, Italy
,
Rene Cruz
UCSD, US

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 October 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 90 of 196 submissions, 46%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
234
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Osipova N(2019)Batch processor sharing with hyper-exponential service timeOperations Research Letters10.1016/j.orl.2007.11.00336:3(372-376)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1016/j.orl.2007.11.003
Yoshida HSatoda KMurase T(2013)Constructing stochastic model of TCP throughput on basis of stationarity analysis2013 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2013.6831293(1544-1550)Online publication date: Dec-2013
https://doi.org/10.1109/GLOCOM.2013.6831293
Loiseau PGonçalves PBarral JVicat-Blanc Primet P(2010)Modeling TCP throughputPerformance Evaluation10.1016/j.peva.2010.08.01667:11(1030-1043)Online publication date: 1-Nov-2010
https://dl.acm.org/doi/10.1016/j.peva.2010.08.016
Nieminen JKarvo JLassila PPeuhkuri M(2009)Impact of heterogeneous packet sizes on flow fairnessProceedings of the 16th international conference on Telecommunications10.5555/1700234.1700280(248-253)Online publication date: 25-May-2009
https://dl.acm.org/doi/10.5555/1700234.1700280
Nieminen JKarvo JLassila PPeuhkuri M(2009)Impact of heterogeneous packet sizes on flow fairness2009 International Conference on Telecommunications10.1109/ICTEL.2009.5158653(248-253)Online publication date: May-2009
https://doi.org/10.1109/ICTEL.2009.5158653
Lassila PKuusela P(2007)Performance of TCP on low‐bandwidth wireless links with delay spikesEuropean Transactions on Telecommunications10.1002/ett.120719:6(653-667)Online publication date: 5-Apr-2007
https://doi.org/10.1002/ett.1207

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten