Bounds on mean cycle time in acyclic fork-join queueing networks
Optimization and Control
2012-12-20 v1 Systems and Control
Abstract
Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join networks are derived using the -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.
Cite
@article{arxiv.1212.1521,
title = {Bounds on mean cycle time in acyclic fork-join queueing networks},
author = {Nikolai K. Krivulin},
journal= {arXiv preprint arXiv:1212.1521},
year = {2012}
}
Comments
The 4th International Workshop on Discrete Event Systems (WODES'98), University of Cagliary, Cagliari, Sardinia, Italy, August 26-28, 1998