Branching Markov chains: Stability and Applications
(English)Manuscript (preprint) (Other (popular science, discussion, etc.))
We address the stability of certain tree algorithms used to solve the problem of communication between multiple users through a unique shared channel. We propose a general model based on branching Markov chains which allows us to write an intuitive stability condition. When the algorithm is stable, we show that there exist an asymptotic throughput, which is related to the asymptotic size of the underlying tree.
Research subject Mathematics
IdentifiersURN: urn:nbn:se:uu:diva-112238OAI: oai:DiVA.org:uu-112238DiVA: diva2:285452