Markov Chains Competing for Transitions: Application to Large-Scale Distributed Systems
Emmanuelle Anceaume (),
François Castella (),
Romaric Ludinard () and
Bruno Sericola ()
Additional contact information
Emmanuelle Anceaume: IRISA - CNRS
François Castella: Université de Rennes 1
Romaric Ludinard: INRIA Rennes - Bretagne Atlantique
Bruno Sericola: INRIA Rennes - Bretagne Atlantique
Methodology and Computing in Applied Probability, 2013, vol. 15, issue 2, 305-332
Abstract:
Abstract 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.
Keywords: Asymptotic analysis; Competing Markov chains; Large-scale distributed systems; Markov chains; 60J10; 65C40 (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s11009-011-9239-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:15:y:2013:i:2:d:10.1007_s11009-011-9239-6
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009
DOI: 10.1007/s11009-011-9239-6
Access Statistics for this article
Methodology and Computing in Applied Probability is currently edited by Joseph Glaz
More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().