Algebraic modelling and performance evaluation of acyclic fork-join queueing networks
Optimization and Control
2013-01-22 v1 Systems and Control
Abstract
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.
Cite
@article{arxiv.1212.4648,
title = {Algebraic modelling and performance evaluation of acyclic fork-join queueing networks},
author = {Nikolai K. Krivulin},
journal= {arXiv preprint arXiv:1212.4648},
year = {2013}
}
Comments
19 pages, 2 figures, 3 tables