Markov chains competing for transitions: application to large-scale distributed systems

DOI10.1007/S11009-011-9239-6MaRDI QIDQ352904zbMATH OpenOpenAlexFDO

Authors Emmanuelle Anceaume, Romaric Ludinard, Bruno Sericola, Francois Castella

Publication date 5 July 2013

Published in Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11009-011-9239-6

zbMATH Keywords

absorbing Markov chainscomposition of Markov chainsfirst time until absorption

Mathematics Subject Classification ID

Numerical analysis or methods applied to Markov chains (65C40) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• Analysis of a large number of Markov chains competing for transitions
• Waiting time distributions of competing patterns in higher-order Markovian sequences
• Rare event analysis of the state frequencies of a large number of Markov chains
• scientific article; zbMATH DE number 2006656
• A theory of distributed Markov chains

Cites work

• scientific article; zbMATH DE number 3679828 (Why is no real title available?)
• scientific article; zbMATH DE number 3736679 (Why is no real title available?)
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• scientific article; zbMATH DE number 2080510 (Why is no real title available?)
• scientific article; zbMATH DE number 2080852 (Why is no real title available?)
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• Algorithms – ESA 2005
• Automata, Languages and Programming

Cited in

(6)

• Markov Teams ? An analytical approach to process migration in distributed computing systems
• Analysis of a large number of Markov chains competing for transitions
• scientific article; zbMATH DE number 2006656 (Why is no real title available?)
• On Clusters in Markov Chains
• Markov chains for collaboration
• Computing absorbing times via fluid approximations

Describes a project that uses

Uses Software

• Chord

This page was built for publication: Markov chains competing for transitions: application to large-scale distributed systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352904)