A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results (Q1100815): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q213260
Property / reviewed by
 
Property / reviewed by: R. Schassberger / rank
Normal rank
 

Revision as of 05:00, 11 February 2024

scientific article
Language Label Description Also known as
English
A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results
scientific article

    Statements

    A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results (English)
    0 references
    0 references
    1988
    0 references
    For a model of two multiservers in tandem involving the possibility of arriving calls getting lost, the author obtains a lower and an upper bound for the steady-state probability of such a loss. These bounds are themselves loss probabilities, obtained for modifications of the model. The modifications are chosen in such a way that the corresponding loss probabilities are insensitive in the sense that they depend on the service time distributions only through their means. It is shown that their property as bounds is insensitive in the same sense.
    0 references
    0 references
    0 references
    0 references
    0 references
    insensitivity
    0 references
    lower and an upper bound for the steady-state probability
    0 references
    loss probabilities
    0 references