Estimating the Sojourn time sensitivity in queueing networks using perturbation analysis (Q1077824): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q243740
Property / author
 
Property / author: Xi-Ren Cao / rank
Normal rank
 

Revision as of 18:04, 11 February 2024

scientific article
Language Label Description Also known as
English
Estimating the Sojourn time sensitivity in queueing networks using perturbation analysis
scientific article

    Statements

    Estimating the Sojourn time sensitivity in queueing networks using perturbation analysis (English)
    0 references
    0 references
    1987
    0 references
    The sample path perturbation analysis technique developed earlier for the analysis of throughput sensitivities [see e.g., the authors, ibid. 40, 559-582 (1983; Zbl 0496.90034)] is extended to the performance measures involving mean sojourn times of customers. The major features of the sojourn time sensitivity problem are twofold. Firstly, it is a performance associated with servers, and not with customers. Secondly, the average sojourn time in any finite observation period can be a discontinuous function of mean service times when blocking is involved in a system. This discontinuity causes errors which must be accounted for in the estimation of sensitivities. Numerical experiments and analysis validate this method of computation of the sensitivities.
    0 references
    sample path perturbation analysis technique
    0 references
    performance measures
    0 references
    sensitivity problem
    0 references
    numerical experiments
    0 references
    computation of the sensitivities
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references