Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization (Q2031356)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization |
scientific article; zbMATH DE number 7356896
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization |
scientific article; zbMATH DE number 7356896 |
Statements
Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization (English)
0 references
9 June 2021
0 references
Toeplitz-type block-structured Markov chain
0 references
censored Markov chain
0 references
discrete-time Markovian service process
0 references
general independent batch arrival
0 references
queueing
0 references
UL-type \(RG \)-factorization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
