Scaling limits for some Mittag-Leffler queues
Giacomo Ascione, Luigia Caputo

TL;DR
This paper investigates five heavy-tailed queue models with Mittag-Leffler distributions, analyzing their scaling limits to understand how they behave under different traffic conditions, generalizing classical queue models.
Contribution
It introduces five Mittag-Leffler queue models, derives their inter-arrival and service time distributions, and studies their scaling limits to characterize traffic regimes.
Findings
Derived explicit distributions for inter-arrival and service times.
Established scaling limits for the proposed queue models.
Characterized traffic regimes through limiting process behavior.
Abstract
In this paper, we consider five models of heavy-tailed queues involving Mittag-Leffler distributions that generalize the classical queues. These models are suitable modifications of previously defined models in such a way that the classical 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Queuing Theory Analysis · Network Traffic and Congestion Control · Simulation Techniques and Applications
