Stochastic ordering for Markov processes on partially ordered spaces
Mathematics of Operations Research
An Algorithmic Approach to Stochastic Bounds
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
NECESSARY AND SUFFICIENT CONDITIONS FOR THE STOCHASTIC COMPARISON OF JACKSON NETWORKS
Probability in the Engineering and Informational Sciences
Accuracy of strong and weak comparisons for network of queues
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
| Hi-index | 0.00 |
The ⪯φ stochastic comparison (⪯φ ε {⪯st, ⪯wk, ⪯wk*}) of multidimensional Continuous Time Markov Chains (CTMC)s is an efficient but a complex method for the performability evaluation of computer systems. Different techniques can be applied for the stochastic comparison of Markov chains. The coupling is an intuitive method, and may be applied by comparing the evolution of sample paths due to events to establish the ⪯st ordering. The increasing set method is based on the comparison of transition rates for a family of increasing sets. It is a more general formalism as it can be applied for all of these orderings: ⪯st, ⪯wk, and ⪯wk*. The goal of this paper is to identify the relationships between these orderings, in order to determine the method to apply for establishing comparisons between models. Altough the ⪯st ordering between random variables implies ⪯wk and ⪯wk* orderings, this result could not be generalized to the comparison of stochastic processes. However even the ⪯st ordering does not exist between processes, the ⪯wk and the ⪯wk* constraints could be satisfied. In this paper, we aim to give the intuition to choose the most suitable method with respect to the underlying performability study.