Beyond the \(c\mu\) rule: Dynamic scheduling of a two-class loss queue (Q1298728)
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 1326491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beyond the \(c\mu\) rule: Dynamic scheduling of a two-class loss queue |
scientific article; zbMATH DE number 1326491 |
Statements
Beyond the \(c\mu\) rule: Dynamic scheduling of a two-class loss queue (English)
0 references
5 October 1999
0 references
polling system
0 references
stochastic scheduling
0 references
finite buffer
0 references
loss penalty
0 references
threshold policy
0 references
\(c\mu\) rule
0 references
0.8855178
0 references
0.8763771
0 references
0.8738215
0 references
0 references
0.8689811
0 references
