作者: Cs Király , Michele Garetto , Michela Meo , M Ajmone Marsan , R Lo Cigno
DOI: 10.1016/J.PEVA.2004.07.002
关键词: Computation 、 Queuing network 、 Asymptotic complexity 、 Distribution (mathematics) 、 Transmission Control Protocol 、 Completion time 、 Quantile 、 Network topology 、 Algorithm 、 Mathematics 、 Real-time computing
摘要: A new technique for the analytical evaluation of distributions (and quantiles) completion time short-lived TCP connections is presented and discussed. The proposed derives from known open multiclass queuing network (OMQN) models protocol computes a discrete approximation, with arbitrary accuracy, distribution sojourn time; customers in OMQN, which corresponds to times modeled connections. computationally efficient, its asymptotic complexity independent topology, number concurrent flows, other parameters.