Estimating the sojourn time sensitivity in queueing networks using perturbation analysis

The sample path perturbation analysis technique developed earlier for the analysis of throughput sensitivities (Refs. 1–3) 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.

[1]  J. R. Jackson.  Networks of Waiting Lines , 1957 .

[2]  J. Little.  A Proof for the Queuing Formula: L = λW , 1961 .

[3]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[4]  A. C. Williams,et al.  A generating function approach to queueing network analysis of multiprogrammed computers , 1976, Networks.

[5]  Donald L. Iglehart,et al.  Regenerative Simulation of Response Times in Networks of Queues , 1980, J. ACM.

[6]  Isi Mitrani,et al.  The Distribution of Queuing Network States at Input and Output Instants , 1979, JACM.

[7]  Christos G. Cassandras,et al.  Infinitesimal and finite perturbation analysis for queueing networks , 1982, 1982 21st IEEE Conference on Decision and Control.

[8]  Rajan Suri,et al.  Infinitesimal perturbation analysis of discrete event dynamic systems: A general theory , 1983, The 22nd IEEE Conference on Decision and Control.

[9]  Xi-Ren Cao,et al.  Perturbation analysis and optimization of queueing networks , 1983 .

[10]  R. Suri.  Implementation of sensitivity calculations on a monte carlo experiment , 1983 .

[11]  Xi-Ren Cao,et al.  The phantom customer and marked customer methods for optimization of closed queueing networks with blocking and general service times , 1983, SIGMETRICS '83.

[12]  Xi-Ren Cao.  Convergence of parameter sensitivity estimates in a stochastic experiment , 1984, The 23rd IEEE Conference on Decision and Control.

[13]  Y. Ho.  On the perturbation analysis of discrete-event dynamic systems , 1985 .

[14]  C. Cassandras,et al.  An event domain formalism for sample path perturbation analysis of discrete event dynamic systems , 1985 .

[15]  R. Suri,et al.  Perturbation analysis gives strongly consistent sensitivity estimates for the M/G/ 1 queue , 1988 .