Convexity properties of the overflow in an ordered-entry system with heterogeneous servers (Q1820673): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(86)90087-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094657923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Arrangement of Servers in an Ordered-Entry System / rank
 
Normal rank

Latest revision as of 18:07, 17 June 2024

scientific article
Language Label Description Also known as
English
Convexity properties of the overflow in an ordered-entry system with heterogeneous servers
scientific article

    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

    Identifiers