Abstract
AbstractIn this paper, a method is presented for the efficient estimation of rare‐event (buffer overflow) probabilities in queueing networks using importance sampling. Unlike previously proposed change of measures, the one used here is not static, i.e., it depends on the buffer contents at each of the network nodes. The ‘optimal’ state‐dependent change of measure is determined adaptively during the simulation, using the cross‐entropy method. The adaptive state‐dependent importance sampling algorithm proposed in this paper yields asymptotically efficient simulation of models for which it is shown (formally or otherwise) that no effective static change of measure exists. Simulation results for queueing models of communication systems are presented to demonstrate the effectiveness of the method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
