Nikolai K.Krivulin
Monotonicity Properties and Simple Bounds on the Mean Cycle Time in
Acyclic Fork-Join Queueing Networks
Recent Advances in Information Science and Technology (N.Mastorakis,
Ed.), World Scientific, Singapore, 1998, 147-152
The (max,+)-algebra approach is applied to establish some monotonicity
properties and to get algebraic bounds on the service cycle completion
times in acyclic fork-join queueing networks. The obtained results are
extended to derive simple lower and upper bounds on the mean cycle time
in stochastic networks.