Analytical computation of completion time distributions of short-lived TCP connections

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 time; 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.

[1]  Marco Ajmone Marsan,et al.  Closed queueing network models of interacting long-lived TCP flows , 2004, IEEE/ACM Transactions on Networking.

[2]  Vishal Misra,et al.  Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED , 2000, SIGCOMM.

[3]  Paul Barford,et al.  Critical path analysis of TCP transactions , 2000, Comput. Commun. Rev..

[4]  Matthew Mathis,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

[5]  Stefan Savage,et al.  Modeling TCP latency , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  Rajmohan Rajaraman,et al.  Towards More Complete Models of TCP Latency and Throughput , 2001, The Journal of Supercomputing.

[7]  Eitan Altman,et al.  A stochastic model of TCP/IP with stationary random losses , 2005, TNET.

[8]  Biplab Sikdar,et al.  Analytic models and comparative study of the latency and steady-state throughput of TCP Tahoe, Reno and SACK , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[9]  Biplab Sikdar,et al.  An integrated model for the latency and steady-state throughput of TCP connections , 2001, Perform. Evaluation.

[10]  Marco Mellia,et al.  TCP model for short lived flows , 2002, IEEE Communications Letters.

[11]  Marco Ajmone Marsan,et al.  Modeling short-lived TCP connections with open multiclass queuing networks , 2004, Comput. Networks.

[12]  Asrar U. H. Sheikh,et al.  Code acquisition of DS/SS signals in fading channels using an LMS adaptive filter , 1998, IEEE Communications Letters.

[13]  Fernando Paganini,et al.  Dynamics of TCP/RED and a scalable control , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[14]  Marco Ajmone Marsan,et al.  A detailed and accurate closed queueing network model of many interacting TCP flows , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Marco Ajmone Marsan,et al.  On the Use of Queueing Network Models to Predict the Performance of TCP Connections , 2001, IWDC.

[16]  Yaakov Kogan,et al.  Dimensioning bandwidth for elastic traffic in high-speed data networks , 2000, TNET.

[17]  Donald F. Towsley,et al.  Modeling TCP Reno performance: a simple model and its empirical validation , 2000, TNET.

[18]  Fernando Paganini,et al.  A new TCP/AQM for stable operation in fast networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).