Algorithmic Solution of Some Queues with Overflows

Marcel F. Neuts and Seshavadhani Kumar
Additional contact information
Marcel F. Neuts: University of Delaware
Seshavadhani Kumar: University of Delaware

Management Science, 1982, vol. 28, issue 8, 925-935

Abstract: The overflow stream from an M/PH/1 queue of finite capacity is used as the input to an unbounded queue with one or more exponential servers. It is shown that the combined system, consisting of the two queues, may be studied as a highly structured Markov process. In the stable case, this Markov process has a matrix-geometric invariant vector. Particular features of the infinitesimal generator of the process may be used to simplify the numerical computation of various steady-state features of the model. Several variants and numerical examples are discussed.

Keywords: overflow in queues; matrix-geometric solution; computational probability (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.28.8.925 (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:ormnsc:v:28:y:1982:i:8:p:925-935

Access Statistics for this article

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