Abstract
We present unbiased Smoothed Perturbation Analysis (SPA) estimators for the derivatives of occupancy-related performance functions in serial networks ofG/G/1 queues with respect to parameters of the distributions of service times at the queues. The sample functions for these performance measures are piecewise constant, and established Infinitesimal Perturbation Analysis (IPA) methods typically fail to provide unbiased estimators in this case. The performance measures considered in this paper are: the average network occupancy as seen by an arrival, the average occupancy of a specific queue as seen by an arrival to it, the probability that a customer is blocked at a specific queue, and the probability that a customer leaves a queue idle. The SPA estimators derived are quite simple and flexible, and they lend themselves to straightforward analysis. Unlike most of the established SPA algorithms, ours are not based on the comparison of hazard rates, and the proofs of their unbiasedness do not require the boundedness of such hazard rates.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Y.C. Ho, X.R. Cao and C.G. Cassandras, Infinitesimal and finite perturbation analysis for queueing networks, Automatica 4(1983)439–445.
Y.C. Ho, Performance evaluation and perturbation analysis of discrete event dynamic systems, IEEE Trans. Auto. Control AC-32(1987)563–572.
R. Suri, Perturbation analysis: The state of the art and research issues explained via theGI/G/1 queue, Proc. IEEE 77(1989)114–137.
L. Chen and R. Suri, Convergence of Infinitesimal Perturbation Analysis for tandem queueing systems with blocking and general service times, Manuscript, Department of Industrial Engineering, University of Wisconsin-Madison (1989).
X.R. Cao, Realization probability in closed Jackson queueing networks and its application, Adv. Appl. Prob. 19(1987)708–738.
P. Glasserman, Structural conditions for perturbation analysis derivative estimates, finite time performance indices, submitted.
X.R. Cao, A sample performance function of closed Jackson queueing networks, Oper. Res. 36(1988)128–136.
M.A. Zazanis and R. Suri, Estimating first and second derivatives of response times forGI/G/1 queues from a single sample path, submitted.
W.-B. Gong and Y.C. Ho, Smoothed (conditional) Perturbation Analysis of discrete event dynamical systems, IEEE Trans. Auto. Control AC-32(1987)858–866.
P. Glasserman and W.-B. Gong, Smoothed Perturbation Analysis for a class of discrete-event systems, IEEE Trans. Auto. Control. AC-35(1990)1218–1230.
M. Fu and J.Q. Hu, On choosing the characterization in Smoothed Perturbation Analysis, submitted.
Y. Wardi, W.-B. Gong, C.G. Cassandras and M.H. Kallmes, Smoothed Perturbation Analysis for a class of piecewise constant sample performance functions, J. Discr. Event Dynamic Syst. 1(1992) 393–414.
J. Walrand,An Introduction to Queueing Networks (Prentice-Hall, 1988).
J.G. Shanthikumar and D.D. Yao, Second-order stochastic properties in queueing systems, Proc. IEEE 77(1989)162–170.
Author information
Authors and Affiliations
Additional information
Supported in part by the National Science Foundation under Grant ECS-8801912, by the Office of Naval Research under Contract N00014-87-K-0304, and by NASA under Contract NAG 2-595.
Rights and permissions
About this article
Cite this article
Wardi, Y., Kallmes, M.H., Cassandras, C.G. et al. Smoothed perturbation analysis algorithms for estimating the derivatives of occupancy-related functions in serial queueing networks. Ann Oper Res 39, 269–293 (1992). https://doi.org/10.1007/BF02060945
Issue Date:
DOI: https://doi.org/10.1007/BF02060945