arXiv Analytics

Sign in

arXiv:1212.1521 [math.OC]AbstractReferencesReviewsResources

Bounds on mean cycle time in acyclic fork-join queueing networks

Nikolai K. Krivulin

Published 2012-12-07Version 1

Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join networks are derived using the $(\max,+)$-algebra approach. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented.

Comments: The 4th International Workshop on Discrete Event Systems (WODES'98), University of Cagliary, Cagliari, Sardinia, Italy, August 26-28, 1998
Journal: Proc. 4th Intern. Workshop on Discrete Event Systems (WODES'98), IEE, London, 1998, pp. 469-474
Categories: math.OC, cs.SY
Subjects: 68M20, 15A80, 93C65, 90B15, 68U20
Related articles: Most relevant | Search more
arXiv:1212.4648 [math.OC] (Published 2012-12-19)
Algebraic modelling and performance evaluation of acyclic fork-join queueing networks
arXiv:1212.5291 [math.OC] (Published 2012-12-20)
Products of random matrices and queueing system performance evaluation
arXiv:1212.6098 [math.OC] (Published 2012-12-25)
Evaluation of the mean cycle time in stochastic discrete event dynamic systems

Links

Toolbox