IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v15y2013i2d10.1007_s11009-011-9239-6.html
   My bibliography  Save this article

Markov Chains Competing for Transitions: Application to Large-Scale Distributed Systems

Author

Listed:
  • Emmanuelle Anceaume

    (IRISA - CNRS)

  • François Castella

    (Université de Rennes 1)

  • Romaric Ludinard

    (INRIA Rennes - Bretagne Atlantique)

  • Bruno Sericola

    (INRIA Rennes - Bretagne Atlantique)

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.

Suggested Citation

  • Emmanuelle Anceaume & François Castella & Romaric Ludinard & Bruno Sericola, 2013. "Markov Chains Competing for Transitions: Application to Large-Scale Distributed Systems," Methodology and Computing in Applied Probability, Springer, vol. 15(2), pages 305-332, June.
    • Handle: RePEc:spr:metcap:v:15:y:2013:i:2:d:10.1007_s11009-011-9239-6
    DOI: 10.1007/s11009-011-9239-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-011-9239-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-011-9239-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:metcap:v:15:y:2013:i:2:d:10.1007_s11009-011-9239-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.