arXiv Analytics

Sign in

arXiv:1212.4648 [math.OC]AbstractReferencesReviewsResources

Algebraic modelling and performance evaluation of acyclic fork-join queueing networks

Nikolai K. Krivulin

Published 2012-12-19Version 1

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

Comments: 19 pages, 2 figures, 3 tables
Journal: Advances in Stochastic Simulation Methods, 2000, pp. 63-81
Categories: math.OC, cs.SY
Subjects: 90B15, 15A80, 90B22, 93C65, 68M20
Related articles: Most relevant | Search more
arXiv:1212.1521 [math.OC] (Published 2012-12-07)
Bounds on mean cycle time in acyclic fork-join queueing networks
arXiv:1212.6098 [math.OC] (Published 2012-12-25)
Evaluation of the mean cycle time in stochastic discrete event dynamic systems
arXiv:1212.5309 [math.OC] (Published 2012-12-21)
On evaluation of the mean service cycle time in tandem queueing systems

Links

Toolbox