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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Xi-Ren Cao / rank
Normal rank
 
Property / author
 
Property / author: Xi-Ren Cao / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation analysis and optimization of queueing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitesimal and finite perturbation analysis for queueing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the <i>M</i>/<i>G</i>/1 Queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: An event domain formalism for sample path perturbation analysis of discrete event dynamic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regenerative simulation of response times in networks of queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of parameter sensitivity estimates in a stochastic experiment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof for the Queuing Formula: <i>L</i> = λ<i>W</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Distribution of Queuing Network States at Input and Output Instants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational algorithms for closed queueing networks with exponential servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generating function approach to queueing network analysis of multiprogrammed computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the perturbation analysis of discrete-event dynamic systems / rank
 
Normal rank

Revision as of 14:52, 17 June 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
    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
    0 references
    0 references
    0 references
    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