Traffic processes in queueing networks: a Markov renewal approach
Traffic processes in queueing networks: a Markov renewal approach
COMPARISONS OF DEPENDENCE FOR STATIONARY MARKOV PROCESSES
Probability in the Engineering and Informational Sciences
Monotonicity In Lag For Nonmonotone Markov Chains
Probability in the Engineering and Informational Sciences
Hi-index | 0.00 |
In this article we introduce isotone differences stochastic ordering of Markov processes on lattice ordered state spaces as a device to compare the internal dependencies of two such processes. We derive a characterization in terms of intensity matrices. This enables us to compare the internal dependency structure of different degradable Jackson networks in which the nodes are subject to random breakdowns and repairs. We show that the performance behavior and the availability of such networks can be compared.