A retrial BMAP/PH/N system (Q1598907)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1746326
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A retrial BMAP/PH/N system |
scientific article; zbMATH DE number 1746326 |
Statements
A retrial BMAP/PH/N system (English)
0 references
28 May 2002
0 references
Retrial queueing models are characterized by the fact that the arrival calls, which find the servers busy, do not line up or leave the system forever, but they try their luck after some random time. In this paper the authors consider a multi-server retrial queueing model with batch Markovian arrival process and phase-type service distribution. This model is suitable for the analysis and optimization of mobile computer communication networks. The continuous-time multi-dimensional Markov chain describing the behavior of the system is investigated by means of reducing it to the corresponding discrete-time multi-dimensional Markov chain.
0 references
\(BMAP/PH/N\) retrial model
0 references
matrix analytic methods
0 references
batch Markovian arrival process
0 references
\(PH\)-distribution
0 references
asymptotically quasi-Toeplitz Markov chain
0 references
0.8547279834747314
0 references
0.8495916724205017
0 references
0.8456977605819702
0 references
0.8443063497543335
0 references
0.8439807295799255
0 references
