A retrial queue with redundancy and unreliable server (Q1339077)
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 698855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A retrial queue with redundancy and unreliable server |
scientific article; zbMATH DE number 698855 |
Statements
A retrial queue with redundancy and unreliable server (English)
0 references
17 July 1995
0 references
This paper introduces a new version of the unreliable \(M/G/1/1\) retrial queue and obtains, amongst other things, using the theory of piecewise Markovian processes, the analogue of the Pollaczek-Khinchin formula for such a queue.
0 references
retrial queue
0 references
Pollaczek-Khinchin formula
0 references
0 references
0.8663075566291809
0 references
0.8636162281036377
0 references
0.8422998785972595
0 references
0.8232821226119995
0 references
