Approximate analysis of non-exhaustive multiserver polling systems with applications to local area networks (Q4734748)
From MaRDI portal
!
WARNING
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 4121397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate analysis of non-exhaustive multiserver polling systems with applications to local area networks |
scientific article; zbMATH DE number 4121397 |
Statements
Approximate analysis of non-exhaustive multiserver polling systems with applications to local area networks (English)
0 references
1989
0 references
local area networks
0 references
performance evaluation
0 references
queues
0 references
multiple servers
0 references
mean waiting-time approximation
0 references
slotted ring
0 references
polling systems
0 references
partial- insertion rings
0 references
0.861826479434967
0 references
0.8364742994308472
0 references
0.8172239065170288
0 references
0.8084670305252075
0 references
0.8042457103729248
0 references
