Strong Embeddings for Transitory Queueing Models
Probability
2019-06-18 v1
Abstract
In this paper we establish strong embedding theorems, in the sense of the Komlos-Major-Tusnady framework, for the performance metrics of a general class of transitory queueing models of nonstationary queueing systems. The nonstationary and non-Markovian nature of these models makes the computation of performance metrics hard. The strong embeddings yield error bounds on sample path approximations by diffusion processes, in the form of functional strong approximation theorems.
Cite
@article{arxiv.1906.06740,
title = {Strong Embeddings for Transitory Queueing Models},
author = {Prakash Chakraborty and Harsha Honnappa},
journal= {arXiv preprint arXiv:1906.06740},
year = {2019}
}