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

Authors:
Cs. Király;M. Garetto;M. Meo;M. Ajmone Marsan;R. Lo Cigno
Affiliations:
Department of Telecommunications, Budapest University of Technology and Economics, Budapest, Hungary;Dipartimento di Elettronica, Politecnico di Torino, Torino, Italy;Dipartimento di Elettronica, Politecnico di Torino, Torino, Italy;Dipartimento di Elettronica, Politecnico di Torino, Torino, Italy;Dipartimento di Informatica e Telecomunicazioni, Universití di Trento, Trento, Italy
Venue:
Performance Evaluation
Year:
2005

Citing 9
Cited 0

The macroscopic behavior of the TCP congestion avoidance algorithm

ACM SIGCOMM Computer Communication Review
Modeling TCP Reno performance: a simple model and its empirical validation

IEEE/ACM Transactions on Networking (TON)
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Dimensioning bandwidth for elastic traffic in high-speed data networks

IEEE/ACM Transactions on Networking (TON)
Critical path analysis of TCP transactions

IEEE/ACM Transactions on Networking (TON)
Towards More Complete Models of TCP Latency and Throughput

The Journal of Supercomputing
An integrated model for the latency and steady-state throughput of TCP connections

Performance Evaluation
Modeling short-lived TCP connections with open multiclass queuing networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Closed queueing network models of interacting long-lived TCP flows

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

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.