Perfect simulation of \(\mathrm{M}/\mathrm{G}/c\) queues (Q2786426)
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: Perfect simulation of \(\mathrm{M}/\mathrm{G}/c\) queues |
scientific article; zbMATH DE number 6541299
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect simulation of \(\mathrm{M}/\mathrm{G}/c\) queues |
scientific article; zbMATH DE number 6541299 |
Statements
12 February 2016
0 references
coalescence
0 references
dominated coupling-from-the-past
0 references
dynamic reversibility
0 references
first-come-first-served discipline
0 references
first-in-first-out discipline
0 references
Kiefer-Wolfowitz workload vector
0 references
pathwise domination
0 references
perfect simulation
0 references
processor sharing discipline
0 references
\(\mathrm{M}/\mathrm{G}/c\) queue
0 references
random assignment discipline
0 references
sandwiching
0 references
stable queue
0 references
stochastic ordering
0 references
super-stable queue
0 references
numerical example
0 references
algorithm
0 references
0 references
0 references
0 references
0 references
0.9164848
0 references
0.9015795
0 references
0.89946234
0 references
0 references
0.88041985
0 references
0.87723327
0 references
Perfect simulation of \(\mathrm{M}/\mathrm{G}/c\) queues (English)
0 references
