If you need an accessible version of this item please contact JSTOR User Support

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

P. T. de Boer, D. P. Kroese and R. Y. Rubinstein
Management Science
Vol. 50, No. 7 (Jul., 2004), pp. 883-895
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/30047946
Page Count: 13
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
A Fast Cross-Entropy Method for Estimating Buffer Overflows in Queueing Networks
Preview not available

Abstract

In this paper, we propose a fast adaptive importance sampling method for the efficient simulation of buffer overflow probabilities in queueing networks. The method comprises three stages. First, we estimate the minimum cross-entropy tilting parameter for a small buffer level; next, we use this as a starting value for the estimation of the optimal tilting parameter for the actual (large) buffer level. Finally, the tilting parameter just found is used to estimate the overflow probability of interest. We study various properties of the method in more detail for the M/M/1 queue and conjecture that similar properties also hold for quite general queueing networks. Numerical results support this conjecture and demonstrate the high efficiency of the proposed algorithm.

Page Thumbnails

  • Thumbnail: Page 
883
    883
  • Thumbnail: Page 
884
    884
  • Thumbnail: Page 
885
    885
  • Thumbnail: Page 
886
    886
  • Thumbnail: Page 
887
    887
  • Thumbnail: Page 
888
    888
  • Thumbnail: Page 
889
    889
  • Thumbnail: Page 
890
    890
  • Thumbnail: Page 
891
    891
  • Thumbnail: Page 
892
    892
  • Thumbnail: Page 
893
    893
  • Thumbnail: Page 
894
    894
  • Thumbnail: Page 
895
    895