Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue (Q1579504)
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: Publication:1579504 |
scientific article; zbMATH DE number 1506728
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue |
scientific article; zbMATH DE number 1506728 |
Statements
Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue (English)
0 references
2 July 2001
0 references
For a multiserver queueing system with multiple types of customers and last-come-first-served non-preemptive service disciple, among other things, a formula and a computational algorithm for the stationary distribution of queue strings are given.
0 references
queues
0 references
matrix analytic methods
0 references
tree structure
0 references
quasi-birth-and-death Markov process
0 references
0 references
0.8180573582649231
0 references
0.7982580661773682
0 references
0.7977932095527649
0 references
0.7953563332557678
0 references
0.7927511930465698
0 references
