Scaling limits for some Mittag-Leffler queues
Abstract
In this paper, we consider five models of heavy-tailed queues involving Mittag-Leffler distributions that generalize the classical M/M/1 queues. These models are suitable modifications of previously defined models in such a way that the classical M/M/1 queue can be recovered by a suitable selection of parameters. We provide the distribution of inter-arrival and service times of both the original and modified queueing models. We then study the scaling limits of all the proposed models and we argue that the behaviour of the limiting processes can be used to characterise the traffic regime of the queues.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.