Markov-modulated PH/G/1 queueing systems (Q811028): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q342501 |
||
Property / reviewed by | |||
Property / reviewed by: Patrick Jaillet / rank | |||
Revision as of 07:47, 13 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Markov-modulated PH/G/1 queueing systems |
scientific article |
Statements
Markov-modulated PH/G/1 queueing systems (English)
0 references
1991
0 references
The authors study a queue in which the arrival process and the service times depend on the state of an underlying Markov chain on a countable state space. The interarrival time has a phase type distribution, the service time is general, and, given the states of the Markov chain, independent of the arrival process. By using properties of Markov- additive processes, the authors derive the busy period process, waiting time and idle time, and then study the special case of a Markov-modulated \(E_ K/G/1\). All the proofs and techniques draw from a previous paper [Queueing Syst. 5, No.1-3, 215-245 (1989; Zbl 0694.60087)] and from \textit{G. J. K. Regterschot} and \textit{J. H. A. de Smit} [Math. Oper. Res. 11, 465-483 (1986; Zbl 0619.60093)].
0 references
queue in which the arrival process and the service times depend on the state
0 references
Markov-additive processes
0 references
waiting time
0 references
idle time
0 references