Perfect sampling for infinite server and loss systems

From MaRDI portal
Publication:3450508

DOI10.1239/AAP/1444308881zbMATH Open1331.65025arXiv1312.4088OpenAlexW2104517172MaRDI QIDQ3450508FDOQ3450508


Authors: Jing Dong, Jose Blanchet Edit this on Wikidata


Publication date: 6 November 2015

Published in: Advances in Applied Probability (Search for Journal in Brave)

Abstract: We present the first class of perfect sampling (also known as exact simulation) algorithms for the steady-state distribution of non-Markovian loss networks. We use a variation of Dominated Coupling From The Past for which we simulate a stationary infinite server queue backwards in time and analyze the running time in heavy traffic. In particular, we are able to simulate stationary renewal marked point processes in unbounded regions. We use the infinite server queue as an upper bound process to simulate loss systems. The running time analysis of our perfect sampling algorithm for loss systems is performed in the Quality-Driven (QD) and the Quality-and-Efficiency-Driven regimes. In both cases, we show that our algorithm achieves sub-exponential complexity as both the number of servers and the arrival rate increase. Moreover, in the QD regime, our algorithm achieves a nearly optimal rate of convergence.


Full work available at URL: https://arxiv.org/abs/1312.4088




Recommendations





Cited In (13)





This page was built for publication: Perfect sampling for infinite server and loss systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450508)