Optimal design of a multiservice system: The line-penalty problem (Q2367368)
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 243486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal design of a multiservice system: The line-penalty problem |
scientific article; zbMATH DE number 243486 |
Statements
Optimal design of a multiservice system: The line-penalty problem (English)
0 references
25 August 1993
0 references
The author considers a system which consists of a set of \(M/M/1\) queueing subsystems, using the same scarce resources, but otherwise running independently. The problem of minimizing the maximum queue lengths is formulated and its poperties are investigated.
0 references
\(M/M/1\) queueing subsystems
0 references
maximum queue lengths
0 references
0 references
0.84718245
0 references
0.84150857
0 references
0.8351432
0 references
0.83441865
0 references
0 references
0.83234656
0 references
0.8322168
0 references
