Efficient Simulation of Population Overflow in Parallel Queues


Share/Save/Bookmark

Nicola, Victor F. and Zaburnenko, Tatiana S. (2006) Efficient Simulation of Population Overflow in Parallel Queues. In: 2006 Winter Simulation Conference, WSC'06, 3 - 6 December 2006, Monterey, California, USA (pp. pp. 398-405).

open access
[img]
Preview
PDF
163kB
Abstract:In this paper we propose a state-dependent importance sampling heuristic to estimate the probability of population overflow in networks of parallel queues. This heuristic approximates the “optimal” state-dependent change of measure without the need for difficult mathematical analysis or costly optimization involved in adaptive methodologies. Comprehensive simulations of networks with an arbitrary number of parallel queues and different traffic intensities yield asymptotically efficient estimates (with relative error increasing sub-linearly in the overflow level) where no other state-independent importance sampling techniques are known to be efficient. The efficiency of the proposed heuristic surpasses those based on adaptive importance sampling algorithms, yet it is easier to determine and implement and scales better for large networks.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/66871
Official URL:http://www.informs-sim.org/wsc06papers/047.pdf
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 237909