Asymptotics for infinite server queues with fast/slow Markov switching and fat tailed service times
Landy Rabehasaina
Abstract:We study a general k dimensional innite server queues process with Markov switching, Poisson arrivals and where the service times are fat tailed with index α ∈ (0, 1).When the arrival rate is sped up by a factor n γ , the transition probabilities of the underlying Markov chain are divided by n γ and the service times are divided by n, we identify two regimes ("fast arrivals", when γ > α, and "equilibrium", when γ = α) in which we prove that a properly rescaled process converges pointwise in distribution to som… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.