Sampling Point Processes on Stable Unbounded Regions and Exam Simulation of Queues
From MaRDI portal
Abstract: Given a marked renewal point process (assuming that the marks are i.i.d.) we say that an unbounded region is stable if it contains finitely many points of the point process with probability one. In this paper we provide algorithms that allow to sample these finitely many points efficiently. We explain how exact simulation of the steady-state measure valued state descriptor of the infinite server queue follows as a simple corollary of our algorithms. We provide numerical evidence supporting that our algorithms are not only theoretically sound but also practical. Finally, having simulation optimization in mind, we also apply our results to gradient estimation of steady-state performance measures.
This page was built for publication: Sampling Point Processes on Stable Unbounded Regions and Exam Simulation of Queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6238240)
