Performance measure bounds in mobile networks by state space reduction
Castel-Taleb, Hind; Mokdad, Lynda (2005), Performance measure bounds in mobile networks by state space reduction, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2005, IEEE Press, p. 1526-1539. http://dx.doi.org/10.1109/MASCOTS.2005.52
TypeCommunication / Conférence
Titre du colloque13th IEEE / ACM International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS 2005)
Date du colloque2005-09
Ville du colloqueAtlanta
Pays du colloqueÉtats-Unis
Titre de l'ouvrage13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2005
MétadonnéesAfficher la notice complète
Résumé (EN)We present in this paper a mathematical method based on stochastic comparisons of Markov chains in order to compute in a mobile network performance measures that are important QoS parameters for users: the dropping handover of voice and the blocking probability of a new voice call. The key idea of this methodology is that given a complex system represented by a multi-dimensional Markov chain which is too large to be solved, we propose to reduce the state space, and so to define a new Markov chain which is a simplified version of the original one. This reduced Markov chain is defined as an aggregated one, which represents a stochastic bound for performance measures written as increasing reward function on the stationary distribution. The main steps of the construction of the aggregated Markov chain applied into mobile networks are presented in this paper. As the number of mobile users with different kinds of applications increases, the associated model is more complex and it can be represented by multi-dimensional continuous time Markov chain with a very large size. Thus, we define an aggregated Markov chain represented by a multi-dimensional birth and death process which is very easy to solve. We have proved that there is a weak ordering between the original Markov chain and the aggregated one using increasing set formalism. We have computed upper bounds of dropping handover and blocking probability for different values of input parameters. Numerical results prove that upper bounds give good results and so the stochastic methodology is an interesting mathematical tool for the performance evaluation of complex systems.
Mots-clésMobile Networks; Quality of Service; Stochastic ordering; stochastic comparisons; Continuous Time Markov Chains
Affichage des éléments liés par titre et auteur.