The single server semi-markov queue

J. H. A. de Smit

Stochastic Processes and their Applications, 1986, vol. 22, issue 1, 37-50

Abstract: A general model for the single server semi-Markov queue is studied. Its solution is reduced to a matrix factorization problem. Given this factorization, results are obtained for the distributions of actual and virtual waiting times, queue lengths both at arrival epochs and in continuous time, the number of customers during a busy period, its length and the length of a busy cycle. Two examples are discussed for which explicit factorizations have been obtained.

Keywords: semi-Markov; queue; matrix; factorization; actual; waiting; time; virtual; waiting; time; queue; length; busy; period; busy; cycle (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0304-4149(86)90112-2
Full text for ScienceDirect subscribers only

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:eee:spapps:v:22:y:1986:i:1:p:37-50

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().