

























We present the first algorithm that samples $\max_{n\geq0}\{S_{n}-n^α\},$ where $S_n$ is a mean zero random walk, and $n^α$ with $α\in(1/2,1)$ defines a nonliner boundary. We show that our algorithm has finite expected running time. We also apply the algorithm to construct the first exact simulation method for the steady-state departure process of a $GI/GI/\infty$ queue where the service time distribution has infinite mean.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。