Stochastic ordering for Markov processes on partially ordered spaces
Mathematics of Operations Research
Performance and reliability analysis of computer systems: an example-based approach using the SHARPE software package
Probability and statistics with reliability, queuing and computer science applications
Probability and statistics with reliability, queuing and computer science applications
On Evaluating the Performability of Degradable Computing Systems
IEEE Transactions on Computers
Aggregated bounding Markov processes applied to the analysis of tandem queues
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
The Performability Tool P'ility
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
| Hi-index | 0.00 |
In this paper, we study the performability of telecommunication systems. Performability verification may be very complex as it is the joint evaluation of performance and dependability. We consider the composite Erlang loss model representing a telecommunication switching system. In this model we suppose that each channel can be free/busy for the performance behavior, and also in a failure/repair state for the availability. We suppose that the system is represented by a multidimensional Markov chain whose size increases quickly with the number of channels. We apply stochastic comparison methods in order to define bounding systems easier to analyze. Different approaches have been used. In the first one, we modify the exact system in order to obtain a bounding system having a product form solution. The other systems are obtained by reducing the size of the exact system, by aggregating the states in order to obtain bounding systems. We compute upper and lower bounds on the blocking probability, and we study the impact of parameters on the quality of the bounds.