Convexity properties of the overflow in an ordered-entry system with heterogeneous servers (Q1820673)
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: Convexity properties of the overflow in an ordered-entry system with heterogeneous servers |
scientific article; zbMATH DE number 3995416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convexity properties of the overflow in an ordered-entry system with heterogeneous servers |
scientific article; zbMATH DE number 3995416 |
Statements
Convexity properties of the overflow in an ordered-entry system with heterogeneous servers (English)
0 references
1986
0 references
The GI/M/m loss system with ordered entry and heterogeneous servers is considered. The main results are the following: If the sequence of added servers have non-increasing service rates, then the overflow probabilities constitute a decreasing convex sequence. If the sequence of added servers have non-decreasing service rates, then the overflow probabilities constitute a decreasing log-concave sequence.
0 references
overflow system
0 references
convexity
0 references
server allocation
0 references
GI/M/m loss system
0 references
ordered entry
0 references
heterogeneous servers
0 references
overflow probabilities
0 references
0 references
0.809795618057251
0 references
0.8094601631164551
0 references
0.7991289496421814
0 references
0.7904311418533325
0 references
0.78965824842453
0 references
