Computing queue length distributions in MAP/G/1/N queue under single and multiple vacation (Q2489384): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2005.07.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998915132 / rank | |||
Normal rank | |||
Revision as of 01:34, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing queue length distributions in MAP/G/1/N queue under single and multiple vacation |
scientific article |
Statements
Computing queue length distributions in MAP/G/1/N queue under single and multiple vacation (English)
0 references
16 May 2006
0 references
The author considers a MAP/G/1/N queue with single and multiple vacations with Markov arrival input process (MAP). He develops steady-state matrix differential equations and obtains the distributions of the number of customers in the queue of various epochs. The embedded Markov chain technique and supplementary variable method are used. A computational procedure is presented in the case of phase-type service-time and vacation-time distributions.
0 references
Markovian arrival process
0 references
single server
0 references
finite buffer
0 references
Markov chain technique
0 references
