TY - GEN
T1 - Stochastic comparisons for performability of telecommunication systems
AU - Castel-Taleb, Hind
AU - Ismael-Aouled, Idriss
AU - Pekergin, Nihal
PY - 2010/8/16
Y1 - 2010/8/16
N2 - 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.
AB - 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.
KW - Markov chains
KW - Performability
KW - Stochastic comparisons
U2 - 10.1007/978-3-642-13568-2_14
DO - 10.1007/978-3-642-13568-2_14
M3 - Conference contribution
AN - SCOPUS:77955450007
SN - 3642135676
SN - 9783642135675
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 189
EP - 203
BT - Analytical and Stochastic Modeling Techniques and Applications - 17th International Conference, ASMTA 2010, Proceedings
T2 - 17th International Conference on Analytical and Stochastic Modeling Techniques and Applications, ASMTA 2010
Y2 - 14 June 2010 through 16 June 2010
ER -