Abstract
Discrete event dynamic systems are studied within the framework of perturbation analysis in this paper. Perturbation is extended from the event times only to both event times and queue lengths. An approximate technique, full-state perturbation analysis (PA), is developed as an extension of the PA approach. Full-state PA is able to deal with problems involving queue length perturbations which often defy existing PA methods, while it still retains all the advantages of existing PA. Full-state PA is used to calculate the throughput sensitivity to the number of customers in closed queueing networks and the throughput sensitivity to routing change. Numerical examples are given. Experimental results verify the validity and accuracy.
Similar content being viewed by others
References
X.R. Cao, “Convergence of parameter sensitivity estimates in a stochastic experiment,”IEEE Trans. Automat. Control, Vol. AC-30, pp. 845–853, 1985a.
X.R Cao, “First-order perturbation analysis of multi-class queueing networks,” inProc. 24th Conf. Decision Control, Ft. Lauderdale, FL, pp. 2028–2033, 1985b.
X.R. Cao, “Sensitivity estimates based on one realization of a stochastic system,”J. Statist. Comput. Simul., Vol. 27, pp. 211–232, 1987.
X.R. Cao, “A sample performance function of closed Jackson queueing networks,”Oper. Res., Vol. 36, No. 1, pp. 128–136, 1988.
X.R. Cao, “A comparison of the dynamics of continuous and discrete event systems,”Proc. IEEE, Vol. 77, No. 1, pp. 7–13, 1989.
X.R. Cao and Y.C. Ho, “Estimating the sojourn time sensitivity in queueing networks using perturbation analysis,”J. Optim. Theory Appl., Vol. 53, No. 3, pp. 353–375, 1987a.
X.R. Cao and Y.C. Ho, “Sensitivity analysis and optimization of throughput in a production line with blocking,”IEEE Trans. Automat. Control, Vol. 32, No. 11, pp. 959–967, 1987b.
C.G. Cassandras and Y.C. Ho, “An event domain fomalism for sample path perturbation analysis of discrete event dynamic systems,”IEEE Trans. Automat. Control, Vol. 30, No. 12, pp. 1217–1221, 1985.
C.G. Cassandras and S.G. Strickland, “Sample path properties of timed discrete event systems,”Proc. IEEE, Vol. 77, No. 1, pp. 59–71, 1989.
M.A. Eyler, “Sensitivity of sample values to parameter changes,”J. Optim. Theory Appl., Vol. 45, No. 1, pp. 159–163, 1985.
W.B. Gong and Y.C. Ho, “Smoothed (conditional) perturbation analysis of discrete event dynamic systems,”IEEE Trans. Automat. Control, Vol. AC-32, No. 10, pp. 858–866, 1987.
P. Heidelberger et al., “Convergence properties of infinitesimal perturbation analysis estimates,”Management Sci., Vol. 34, No. 11, pp. 1281–1302, 1988.
Y.C. Ho, “On the perturbation analysis of discrete-event dynamic systems,”J. Optim. Theory Appl., Vol. 46, No. 4, pp. 535–545, 1985.
Y.C. Ho, “Performance evaluation and perturbation analysis of discrete event dynamic systems,”IEEE Trans. Automat. Control, Vol. AC-32, No. 7, pp. 563–572, 1987.
Y.C. Ho, “Perturbation analysis explained,”IEEE Trans. Automat. Control, Vol. AC-33, No. 8, pp. 761–763, 1988.
Y.C. Ho and X.R Cao, “Perturbation analysis and optimization of queueing networks,”J. Optim. Theory Appl., Vol. 40, No. 4, pp. 559–582, 1983.
Y.C. Ho and X.R. Cao, “Performance sensitivity to routing changes in queueing networks and flexible manufacturing systems using perturbation analysis,”IEEE J. Robotics Automat., Vol. RA-1, No. 4, pp. 165–172, 1985.
Y.C. Ho, X.R. Cao, and C.G. Cassandras, “Infinitesimal and finite perturbation analysis for queueing networks,”Automatica, Vol. 19, No. 4, pp. 439–445, 1983.
Y.C. Ho and C.G. Cassandras, “A new approach to the analysis of discrete event dynamic systems,”Automatica, Vol. 19, No. 2, pp. 149–167, 1983.
Y.C. Ho, M.A. Eyler, and T.T. Chien, “A gradient technique for general buffer storage design in a production line,”Int. J. Prod. Res., Vol. 17, No. 6, pp. 557–580, 1979.
Y.C. Ho and S. Li, “Extensions of infinitesimal perturbation analysis,”IEEE Trans. Automat. Control, Vol. AC-33, No. 5, pp. 427–438, 1988.
Y.C. Ho, S. Li, and P. Vakili, “On the efficient generation of discrete event sample paths under different system parameter values,” forthcoming.
R. Suri, “Implementation of sensitivity calculations on a Monte Carlo experiment,”J. Optim. Theory Appl., Vol. 40, No. 4, pp. 625–630, 1983.
R. Suri, “Perturbation analysis: the state of the art and research issues explained via the GI/G/1 queue,”Proc. IEEE, Vol. 77, No. 1, pp. 114–137, 1989.
R. Suri and X.R. Cao, “The phantom customer and marked customer methods for optimization of closed queueing networks with blocking and general service times,”ACM Perform. Eval. Rev., pp. 243–256, 1983.
R. Suri and M.A. Zazanis, “Perturbation analysis gives strongly consistent sensitivity estimates for the M/G/1 queue,”Management Sci., Vol. 34, No. 1, pp. 39–64, 1988.
A.C. Williams and R.A. Bhandiwad, “A generating function approach to queueing network analysis of multiprogrammed computers,”Networks, Vol. 6, pp. 1–22, 1976.
Author information
Authors and Affiliations
Additional information
This work is supported in part by the National High Technology Project and by Southeast University Research Funds for Young Teachers.
Rights and permissions
About this article
Cite this article
Wang, ZQ., Song, WZ. & Feng, CB. Full-state perturbation analysis of discrete event dynamic systems. Discrete Event Dyn Syst 1, 249–270 (1992). https://doi.org/10.1007/BF01796824
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01796824