Abstract
Telecommunications systems are typically modelled by queueing networks. While a crude a priori indication of the network performance can be obtained in special cases by mathematical analysis, the precise performance evaluation by off-line stochastic simulation and by on-line measurements is a central issue is systems analysis, design and operation. Off-line and especially on-line evaluation of the gradient of the expected performance with respect to the various parameters (such as arrival rate, service rate or routing probabilities) is also very important since it not only measures the sensitivity to parameter change, but is also needed for optimizing the network configuration (flow and/or capacity assignment). For resource allocation and for determining the speed with which optimization algorithms adapt to changing network conditions, it is important to know the necessary computing or measurement time for performance evaluation and its optimization, given a needed accuracy. This paper provides analytical formulas for this purpose.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Asmussen, Queueing simulation in heavy traffic, Math. Oper. Res. 17(1992)84–111.
S. Asmussen and R.Y. Rubinstein, The efficiency and heavy traffic properties of the score function method for sensitivity analysis of queueing models, Adv. Appl. Prob. 24(1992)172–201.
Y.C. Ho and X.R. Cao, Perturbation analysis and optimization of queueing networks, J. Optim. Th. Appl. 40(1983)559–582.
M. Kaplan, A twofold tandem net with deterministic links and source interference, Oper. Res. 28(1980)121–131.
L. Kleinrock,Queueing Systems, Vol. 2 (Wiley, 1976).
M.I. Reiman and A. Weiss, Sensitivity analysis for simulation via likelihood ratio, Oper. Res. 37(1989)830–844.
R.Y. Rubinstein, Sensitivity of computer simulation models via the efficient score, Oper. Res. 37(1989)72–81.
R.Y. Rubinstein,Monte Carlo Optimization, Simulation and Sensitivity of Queueing Networks (Wiley, 1986).
M. Shalmon, TheGI/GI/1 queue and its variations via the LCFS preemptive resume discipline, Prob. Eng. Inform. Sci. 2(1988)215–230.
M. Shalmon and R.Y. Rubinstein, Error analysis for regenerative queueing estimators with special reference to gradient estimators via likelihood ratio, Ann. Oper. Res. 36(1992)383–396.
M. Shalmon, The moments of the regenerative estimators for theM/G/1 queue and their interpretation as functionals of an associated branching process, in preparation.
M. Shalmon, TheM/G/1 queue via the LCFS nonpreemptive discipline and its probabilistic interpretation, INRS-Telecommun. Technical Report No. 88-19 (1988).
R. Suri and M. Zazanis, Perturbation analysis gives strongly consistent sensitivity estimates for theM/G/1 queue, Manag. Sci. 34(1988)39–64.
R. Suri, Perturbation analysis: The state of the art and research issues explained via theGI/GI/1 queue, Proc. IEEE 77(1989)114–137.
W. Whitt, Planning queueing simulations, Manag. Sci. 35(1989)1341–1366.
Author information
Authors and Affiliations
Additional information
Work supported by NSERC Grant No. OGP0003907.
Rights and permissions
About this article
Cite this article
Shalmon, M. How fast is the stochastic evaluation of expected performance and its parametric sensitivity. Telecommunication Systems 2, 379–397 (1993). https://doi.org/10.1007/BF02109866
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02109866