Unreliable queueing systems (Q1086135): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:58, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Unreliable queueing systems |
scientific article |
Statements
Unreliable queueing systems (English)
0 references
1985
0 references
We analyze an unreliable queueing system that services customers. The service facility may have one or more identical servers that are subject to random breakdowns and repairs. The infinitesimal generator of the underlying Markov process has a block tri-diagonal structure. We demonstrate the computational tractability of an unreliable queueing system by the matrix geometric method.
0 references
unreliable queueing system
0 references
Markov process
0 references
block tri-diagonal structure
0 references
matrix geometric method
0 references