doi:10.1016/j.peva.2004.07.002
Copyright © 2004 Elsevier B.V. All rights reserved.
Analytical computation of completion time distributions of short-lived TCP connections
aDepartment of Telecommunications, Budapest University of Technology and Economics, Budapest, Hungary
bDipartimento di Elettronica, Politecnico di Torino, Torino, Italy
cDipartimento di Informatica e Telecomunicazioni, Università di Trento, Trento, Italy
Available online 11 September 2004.
Abstract
A new technique for the analytical evaluation of distributions (and quantiles) of the completion time of short-lived TCP connections is presented and discussed. The proposed technique derives from known open multiclass queuing network (OMQN) models of the TCP protocol and computes a discrete approximation, with arbitrary accuracy, of the distribution of sojourn times of customers in the OMQN, which corresponds to the distribution of completion times of the modeled TCP connections. The proposed technique is computationally efficient, and its asymptotic complexity is independent of the network topology, of the number of concurrent flows, and of other network parameters.
Keywords: TCP; Queuing networks; Completion time distribution; Analytical models
Fig. 1. Samples of connections evolution within a simplified TCP OMQN model.
Fig. 2. The OMQN model of TCP NewReno.
Fig. 3. Sketch of the recursive procedure to derive the probability mass function of
.
Fig. 4. Impact of R on the distribution of the TCP connection completion time.
Fig. 5. Single bottlenecks scenario with homogeneous connections.
Fig. 6. CDF and CCDF of the completion time. Single bottleneck, homogeneous connections with Ns=100 and ρn=0.9; Analysis (
ms and PL=1.64%) and simulation (
ms and PL=1.61%).
Fig. 7. Analysis and simulation. Probability density function. Single bottleneck, homogeneous connections with Ns=100 and ρn=0.9.
Fig. 8. CCDF, single bottleneck, connections with Ns=10 and ρn=0.95. Analysis (
ms and PL=0.6%) and simulation (
ms and PL=0.5%).
Fig. 9. Two bottlenecks scenario, non-homogeneous connections. Setup (left) and simulation results (right). Flows from router 2 to router 1 (
ms and PL=0.7%) and from router 3 to router 1 (
ms and PL=2.7%).
Fig. 10. Analysis and simulation. Complement of the cumulative distribution function. Two bottlenecks scenario, non-homogeneous connections. Connection length Ns=100 (left) and Ns=10 (right).
Fig. 11. CDF and CCDF. Single bottleneck scenario, mixed UDP and TCP traffic. Connection length Ns=10. Analysis and simulation (
ms and PL=29%).
Fig. 12. Analytical results. Mean of the completion time as a function of the connection length and of the segment loss probability.
Fig. 13. Analytical results: 0.95 (left) and 0.99 (right) completion time quantiles as a function of the connection length Ns and the segment loss probability PL.
A preliminary version of this paper was presented at the HET-NETs’03 Conference, Ilkley, West Yorkshire, UK, July 2003.

Corresponding author.