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 probability. The same TCP connection is possibly used...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Performance evaluation Jg. 65; H. 6; S. 512 - 530
Hauptverfasser: Baccelli, François, McDonald, David R.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.06.2008
Schlagworte:
Additive increase–multiplicative decrease algorithm
Congestion control protocol
HTTP
IP traffic
Markov process
On-off flow
Ordinary differential equation
TCP
Throughput
Congestion control protocol
TCP
Markov process
On-off flow
Throughput
HTTP
Additive increase–multiplicative decrease algorithm
Ordinary differential equation
IP traffic
ISSN:0166-5316, 1872-745X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0166-5316
1872-745X
DOI:10.1016/j.peva.2007.12.006