On two-queue Markovian polling systems with exhaustive service (Q475140)
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: On two-queue Markovian polling systems with exhaustive service |
scientific article; zbMATH DE number 6373866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On two-queue Markovian polling systems with exhaustive service |
scientific article; zbMATH DE number 6373866 |
Statements
On two-queue Markovian polling systems with exhaustive service (English)
0 references
25 November 2014
0 references
two-queue Markovian polling systems
0 references
discrete-time Markov chain
0 references
waiting-time distribution
0 references
queue length distribution
0 references
heavy-traffic behaviour
0 references
0 references
0 references
0.8376927971839905
0 references
0.8299193382263184
0 references
0.8284983038902283
0 references
0.8276764750480652
0 references
