Monotonicity and performance evaluation: applications to high speed and mobile networks

Abstract : We illustrate through examples how monotonicity may help for performance evaluation of networks. We consider two different applications of stochastic monotonicity in performance evaluation. In the first one, we assume that a Markov chain of the model depends on a parameter that can be estimated only up to a certain level and we have only an interval that contains the exact value of the parameter. Instead of taking an approximated value for the unknown parameter, we show how we can use the monotonicity properties of the Markov chain to take into account the error bound from the measurements. In the second application, we consider a well known approximation method: the decomposition into Markovian submodels. In such an approach, models of complex networks or other systems are decomposed into Markovian submodels whose results are then used as parameters for the next submodel in an iterative computation. One obtains a fixed point system which is solved numerically. In general, we have neither an existence proof of the solution of the fixed point system nor a convergence proof of the iterative algorithm. Here we show how stochastic monotonicity can be used to answer these questions and provide, to some extent, the theoretical foundations for this approach. Furthermore, monotonicity properties can also help to derive more efficient algorithms to solve fixed point systems.
Liste complète des métadonnées
Contributeur : Ana Busic <>
Soumis le : mardi 18 juin 2013 - 14:40:15
Dernière modification le : vendredi 25 mai 2018 - 12:02:04

Lien texte intégral




Ana Busic, Jean-Michel Fourneau. Monotonicity and performance evaluation: applications to high speed and mobile networks. Cluster Computing, Springer Verlag, 2012, 15 (4), pp.401-414. 〈〉. 〈10.1007/s10586-011-0160-0〉. 〈hal-00835351〉



Consultations de la notice