Stability Conditions for Multidimensional Queueing Systems with Computer Applications

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

Operations Research, 1988, vol. 36, issue 6, 944-957

Abstract: A fundamental question arising in the analysis of queueing systems is whether a system is stable or unstable. For systems modeled by infinite Markov chains, we may study the ergodicity and nonergodicity of the chains. Foster showed that sufficient conditions for ergodicity are linked with the average drift. However, complications arise when multidimensional Markov chains are analyzed. We present three methods that provide sufficient conditions for ergodicity and nonergodicity of a multidimensional Markov chain. These methods are next applied to two multidimensional queueing systems: buffered contention packet broadcast systems and coupled processor systems.

Keywords: communications: stability of random access protocols; computers: stability of multiprocessor systems; Markov processes: ergodicity and nonergodicity of multidimensional Markov chains (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.36.6.944 (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:944-957

Access Statistics for this article

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