26801 articles – 20464 Notices  [english version]
Voir la fiche détaillée Rapports
Liste des fichiers attachés à ce document :
PDF
RR-1953.pdf(498.2 KB)
Markov Chains Competing for Transitions: Application to Large-Scale Distributed Systems
Emmanuelle Anceaume1, François Castella2, 3, Romaric Ludinard1, Bruno Sericola4

We consider the behavior of a stochastic system composed of several identically distributed, but non independent, discrete-time absorbing Markov chains competing at each instant for a transition. The competition consists in determining at each instant, using a given probability distribution, the only Markov chain allowed to make a transition. We analyze the first time at which one of the Markov chains reaches its absorbing state. We obtain its distribution and its expectation and we propose an algorithm to compute these quantities. We also exhibit the asymptotic behavior of the system when the number of Markov chains goes to infinity. Actually, this problem comes from the analysis of large-scale distributed systems and we show how our results apply to this domain.
1 :  INRIA - IRISA - ADEPT
2 :  IRMAR - Institut de Recherche Mathématique de Rennes
3 :  INRIA - IRMAR - IPSO
4 :  INRIA - IRISA - DIONYSOS
Markov Chains – Competing Markov Chains – Asymptotic Analysis – Large-Scale Distributed Systems