A Fast Cross-Entropy Method for Estimating Buffer Overflows in Queueing Networks

References

• Alon G., Kroese D. P., Raviv T., Rubinstein R. Y. Application of the cross entropy method for buffer allocation problem in simulation-based environment. Ann. Oper. Res. (2005) . ForthcomingCrossref, Google Scholar
• Asmussen S., Rubinstein R. Y., Dshalalow J. Complexity properties of steady-state rare events simulation in queueing models. Advances in Queueing: Theory, Methods and Open Problems (1995) 1(CRC Press)429–462Google Scholar
• Asmussen S., Rubinstein R. Y., Wang C.-L. Regenerative rare event simulation via likelihood ratios. J. Appl. Probab. (1994) 31(3):797–815Crossref, Google Scholar
• de Boer P. T. Analysis and efficient simulation of queueing models of telecommunications systems. . Ph.D. thesis, University of Twente, Enschede, The NetherlandsGoogle Scholar
• de Boer P. T., Nicola V. F. Adaptive state-dependent importance sampling simulation of Markovian queueing networks. Eur. Trans. Telecomm. (2001) 13(4):303–315Crossref, Google Scholar
• de Boer P. T., Nicola V. F., Rubinstein R. Y., Joines J. A., Barton R. R., Kang K., Fishwick P. A. Adaptive importance sampling simulation of queueing networks. Proc. 2000 Winter Simulation Conf. (2000) (Orlando, FL)646–655Crossref, Google Scholar
• Devetsikiotis M., Townsend J. K. Statistical optimization of dynamic importance sampling parameters for efficient simulation of communication networks. IEEE/ACM Trans. Networking (1993a) 1:293–305Crossref, Google Scholar
• Devetsikiotis M., Townsend J. K. An algorithmic approach to the optimization of importance sampling parameters in digital communication system simulation. IEEE Trans. Comm. (1993b) 41:1464–1473Crossref, Google Scholar
• Feller W.An Introduction to Probability Theory and Its Applications I (1968) 3rd ed.(John Wiley and Sons, New York) Google Scholar
• Frater M. R., Lennon T. M., Anderson B. D. O. Optimally efficient estimation of the statistics of rare events in queueing networks. IEEE Trans. Automat. Control (1991) 36:1395–1405Crossref, Google Scholar
• Glasserman P., Kou S.-G. Analysis of an importance sampling estimator for tandem queues. ACM Trans. Model. Comput. Simulation (1995) 5(1):22–42Crossref, Google Scholar
• Jorgensen B.The Theory of Dispersion Models (1997) (Chapman and Hall, London U.K.) Google Scholar
• Heidelberger P. Fast simulation of rare events in queueing and reliability models. ACM Trans. Model. Comput. Simulation (1995) 5(1):43–85Crossref, Google Scholar
• Kapur J. N., Kesavan H. K.Entropy Optimization Principles with Applications (1992) (Academic Press, New York) Crossref, Google Scholar
• Kriman V., Rubinstein R. Y., Dshalalow J. Polynomial time algorithms for estimation of rare events in queueing models. Frontiers in Queueing: Models and Applications in Science and Engineering (1997) (CRC Press, New York) 421–448Google Scholar
• Lieber D., Rubinstein R. Y., Elmakis D. Quick estimation of rare events in stochastic networks. IEEE Trans. Reliability (1997) 46(2):254–265Crossref, Google Scholar
• Morris C. N. Natural exponential families with quadratic variance functions. Ann. Statist. (1982) 10(1):65–80Crossref, Google Scholar
• Parekh S., Walrand J. A quick simulation method for excessive backlogs in networks of queues. IEEE Trans. Automat. Control (1989) 34:54–66Crossref, Google Scholar
• Qaq W. A. al-, Devetsikiotis M., Townsend J. K. Stochastic gradient optimization of importance sampling for the efficient simulation of digital communication systems. IEEE Trans. Comm. (1995) 43:2975–2985Crossref, Google Scholar
• Rubinstein R. Y. Optimization of computer simulation models with rare events. Eur. J. Oper. Res. (1997) 99:89–112Crossref, Google Scholar
• Rubinstein R. Y. The simulated entropy method for combinatorial and continuous optimization. Methodology Comput. Appl. Probab. (1999) 2:127–190Crossref, Google Scholar
• Rubinstein R. Y., Gass S., Harris C. Combinatorial optimization via cross-entropy. Encyclopedia of Operations Research and Management Sciences (2001a) (Kluwer, Dordrecht, The Netherlands)102–106Crossref, Google Scholar
• Rubinstein R. Y., Uryasev S., Pardalos P. M. Combinatorial optimization cross-entropy, ants, and rare events. Stochastic Optimization: Algorithms and Applications (2001b) (Kluwer, Dordrecht, The Netherlands)304–358Crossref, Google Scholar
• Rubinstein R. Y. Cross-entropy and rare events for maximal cut and partition problems. ACM Trans. Model. Comput. Simulation (2002) 12(1):27–53(TOMACS)Crossref, Google Scholar
• Rubinstein R. Y., Melamed B.Modern Simulation and Modeling (1998) (John Wiley and Sons, New York) Google Scholar
• Rubinstein R. Y., Shapiro A.Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization via the Score Function Method (1993) (John Wiley and Sons, New York) Google Scholar
• Sadowsky J. S. Large deviations theory and efficient simulation of excessive backlogs in a GI/GI/m queue. IEEE Trans. Automat. Control (1991) 36(12):1383–1394Crossref, Google Scholar