Queues Solvable without Rouché's Theorem

Marcel F. Neuts
Additional contact information
Marcel F. Neuts: University of Delaware, Newark, Delaware

Operations Research, 1979, vol. 27, issue 4, 767-781

Abstract: We give a novel analysis of the steady-state probabilities of a class of infinite Markov chains. Markov chains of this type appear in the study of bulk queues and a variety of other stochastic models. We present algorithms that involve only real arithmetic and avoid the traditional analysis based on Rouché's theorem.

Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.4.767 (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:27:y:1979:i:4:p:767-781

Access Statistics for this article

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