Some Theorems on Instability with Applications to Multiaccess Protocols

Wojciech Szpankowski and Vernon Rego
Additional contact information
Wojciech Szpankowski: Purdue University, West Lafayette, Indiana
Vernon Rego: Purdue University, West Lafayette, Indiana

Operations Research, 1988, vol. 36, issue 6, 958-966

Abstract: An important question in stochastic modeling is whether a denumerable state Markov chain describing a system is stable or not. Adopting a general definition of stability, we discuss some conditions for instability. We extend slightly previous results on nonergodicity, and we present new criteria for moments of a chain to be infinite. Finally, we apply these instability conditions to study some multidimensional Markov chains that describe multiaccess protocols in a broadcast environment. In particular, we prove that the exponential backoff algorithm is unstable for λ > 0.461, and the decentralized dynamic control algorithm is unstable for λ > e −1 = 0.368.

Keywords: communications: instability of multiaccess protocols; probability; Markov processes: generalized drift; nonergodicity and instabilities of multidimensional Markov chains (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.36.6.958 (application/pdf)

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:inm:oropre:v:36:y:1988:i:6:p:958-966

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().