On the Use of Queueing Network Models to Predict the Performance of TCP Connections

摘要: In this paper we describe an analytical approach to estimate the performance of greedy and short-lived TCP connections, assuming that only primitive network parameters are known, deriving from them round trip time, loss probability throughput as well average completion times in case flows. It exploits queuing paradigm develop one or more 'TCP sub-models' a 'network sub-model,' iteratively solved until convergence. Our modeling allows taking into consideration different versions multi-bottleneck networks, producing solutions at small computational cost. Numerical results for some simple single topologies used prove accuracy predictions, discuss common practice applying flows predictions computed connections.