×

Robustness of perturbation analysis estimators for queueing systems with unknown distributions. (English) Zbl 0790.60075

Summary: Sample-path-based stochastic gradient estimators for performance measures of queueing systems rely on the assumption that a probability distribution of the random vector of interest (e.g., a service or interarrival time sequence) is given. We address the issue of dealing with unknown probability distributions and investigate the robustness of such estimators with respect to possibly erroneous distribution choices. We show that infinitesimal perturbation analysis (IPA) can be robust in this sense and, in some cases, provides distribution-independent estimates. Comparisons with other gradient estimators are provided, including experimental results. We also show that finite perturbation analysis (FPA), though only providing gradient approximations, possesses some attractive robustness properties with respect to unknown distribution parameters. An application of FPA estimation is included for a queueing system performance optimization problem involving customers with real-time constraints.

MSC:

60K25 Queueing theory (aspects of probability theory)
93E20 Optimal stochastic control
90B22 Queues and service in operations research
Full Text: DOI

References:

[1] Robbins, H., andMonro, S.,A Stochastic Approximation Method, Annals of Mathematical Statistics, Vol. 22, pp. 400-407, 1951. · Zbl 0054.05901 · doi:10.1214/aoms/1177729586
[2] Rubinstein, R. V.,Monte Carlo Optimization, Simulation, and Sensitivity Analysis of Queueing Networks, Wiley, New York, New York, 1986. · Zbl 0664.65059
[3] Ho, Y. C.,Performance Evaluation and Perturbation Analysis of Discrete Event Dynamic Systems, IEEE Transactions on Automatic Control, Vol. AC-32, pp. 563-572, 1987. · Zbl 0627.93034
[4] Suri, R.,Perturbation Analysis: The State of the Art and Research Issues Explained via the GI/G/1 Queue, Proceedings of the IEEE, Vol. 77, pp. 114-137, 1989. · doi:10.1109/5.21075
[5] Heidelberger, P., andTowsley, D.,Sensitivity Analysis from Sample Paths Using Likelihoods, Management Science, Vol. 35, pp. 1475-1488, 1989. · Zbl 0684.62064 · doi:10.1287/mnsc.35.12.1475
[6] Reiman, M. I., andWeiss, A.,Sensitivity Analysis for Simulations via Likelihood Ratios, Operations Research, Vol. 37, pp. 830-844, 1989. · Zbl 0679.62087 · doi:10.1287/opre.37.5.830
[7] Cao, X.,Convergence of Parameter Sensitivity Estimates in a Stochastic Experiment, IEEE Transactions on Automatic Control, Vol. AC-30, pp. 834-843, 1985.
[8] Gong, W. B., andHo, Y. C.,Smoothed Perturbation Analysis of Discrete Event Dynamic Systems, IEEE Transactions on Automatic Control, Vol. AC-32, pp. 858-866, 1987. · Zbl 0634.93076 · doi:10.1109/TAC.1987.1104464
[9] Ho, Y. C., andLi, S.,Extensions of the Perturbation Analysis Techniques for Discrete Event Dynamic Systems, IEEE Transactions on Automatic Control, Vol. AC-33, pp. 427-438, 1988. · Zbl 0637.90091 · doi:10.1109/9.1221
[10] Ho, Y. C., Cao, X., andCassandras, C. G.,Infinitesimal and Finite Perturbation Analysis for Queueing Networks, Automatica, Vol. 19, pp. 439-445, 1983. · Zbl 0514.90028 · doi:10.1016/0005-1098(83)90060-2
[11] Cassandras, C. G., andLee, J. I.,Applications of Perturbation Techniques to Optimal Resource Sharing in Discrete Event Systems, Proceedings of the 1988 American Control Conference, Atlanta, Georgia, Vol. 1, pp. 450-455, 1988.
[12] Gallager, R. G.,A Minimum Delay Routing Algorithm Using Distributed Computation, IEEE Transactions on Communications, Vol. COM-25, pp. 73-85, 1977. · Zbl 0361.68086 · doi:10.1109/TCOM.1977.1093711
[13] Tantawi, A., andTowsley, D.,Optimal Static Load Balancing in Distributed Computer Systems, Journal of the Association for Computing Machinery, Vol. 32, pp. 445-465, 1985. · Zbl 0629.68003
[14] Suri, R.,Infinitesimal Perturbation Analysis for General Discrete Event Systems, Journal of the Association for Computing Machinery, Vol. 34, pp. 686-717, 1987.
[15] Suri, R., andZazanis, M.,Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue, Management Science, Vol. 34, pp. 39-64, 1988. · Zbl 0636.60102 · doi:10.1287/mnsc.34.1.39
[16] Cassandras, C. G., andStrickland, S. G.,Perturbation Analytic Methodologies for Design and Optimization of Communication Networks, IEEE Journal of Selected Areas in Communications, Vol. 6, pp. 158-171, 1988. · doi:10.1109/49.192739
[17] Kleinrock, L.,Queueing Systems, Vol. 1: Theory, Wiley, New York, New York, 1975. · Zbl 0334.60045
[18] Kurose, J. F., andChipalkatti, R.,Load Sharing in Soft Real-Time Distributed Computer Systems, IEEE Transactions on Computers, Vol. C-36, pp. 993-1000, 1987. · doi:10.1109/TC.1987.5009522
[19] Holtzman, J. M.,On Using Perturbation Analysis to Do Sensitivity Analysis, Proceedings of the 28th IEEE Conference on Decision and Control, Tampa, Florida, Vol. 3, pp. 2018-2023, 1989. · doi:10.1109/CDC.1989.70519
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.