Simulation based analysis of completion time distribution for short-lived TCP flows

In this paper we present some preliminary results on the analysis of completion time distributions of shortlived TCP connections. In particular, we consider an heterogeneous traffic scenario composed of greedy and finite TCP connections that share the capacity and buffer of a bottleneck link with UDP data sources. The main goal is to evaluate the impact of the congestion control algorithms on the parameters of the completion time distribution. The analysis is based on simulation experiments conducted using ns-2. Interesting results regarding the behavior of shortlived TCP connections are obtained and discussed throughout the paper.