Analyzing priority queues with 3 classes using tree-like processes (Q854994)
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 5080854
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analyzing priority queues with 3 classes using tree-like processes |
scientific article; zbMATH DE number 5080854 |
Statements
Analyzing priority queues with 3 classes using tree-like processes (English)
0 references
20 December 2006
0 references
The authors use tree-like processes to study a general class of priority queues with three services classes. Their main result is that the queue length distributions and loss rate are obtained by applying a censoring argument on the steady state of the tree-like process. Their key approach is matrix analytic methods. Moreover, numerical examples are used to illustrate the strength of the approach.
0 references
matrix analytic methods
0 references
0 references
0 references
0.7544667720794678
0 references
0.753871500492096
0 references
0.7501330971717834
0 references
0.7432013750076294
0 references
0.7420626878738403
0 references
