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 recognize three distinct properties of the method which together explain why the method works well; we conjecture that they hold for quite general queueing networks. Numerical results support this conjecture and demonstrate the high efficiency of the proposed algorithm.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2002 Winter Simulation Conference (WSC 2002) |
Editors | E. Yücesan, C.-H. Chen, J.L. Snowdon, J.M. Charnes |
Place of Publication | Piscataway, NJ |
Publisher | IEEE |
Pages | 301-309 |
Number of pages | 9 |
ISBN (Print) | 0-7803-7615-3, 0-7803-7614-5 |
DOIs | |
Publication status | Published - Dec 2002 |
Event | 2002 Winter Simulation Conference - San Diego, United States Duration: 8 Dec 2002 → 11 Dec 2002 |
Conference
Conference | 2002 Winter Simulation Conference |
---|---|
Abbreviated title | WSC 2002 |
Country/Territory | United States |
City | San Diego |
Period | 8/12/02 → 11/12/02 |
Keywords
- 2023 OA procedure