Bounds on mean cycle time in acyclic fork-join queueing networks
arXiv:1212.15211 citationsh-index: 17
Originality Synthesis-oriented
AI Analysis
Provides theoretical bounds for performance analysis of fork-join queueing networks, which are important in manufacturing and computer systems.
The paper derives simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join networks using (max,+)-algebra, and discusses their behavior under various service time assumptions with numerical examples.
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.