Modelling extreme uncertainty: Queues with Pareto inter-arrival times and Pareto service times
Loading...
Official URL
Full text at PDC
Publication date
2025
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
Citation
Ramirez-Velarde, R., Pareja-Flores, C., Hernandez-Gress, N., Hervert-Escobar, L. (2025). Modelling Extreme Uncertainty: Queues with Pareto Inter-arrival Times and Pareto Service Times. In: Paszynski, M., Barnard, A.S., Zhang, Y.J. (eds) Computational Science – ICCS 2025 Workshops. ICCS 2025. Lecture Notes in Computer Science, vol 15912. Springer, Cham. https://doi.org/10.1007/978-3-031-97573-8_16
Abstract
When an operational parameter presents extremely high variability, uncertainty becomes extreme. Long-tail probability distributions can be used to model such uncertainty. We present a queuing system in which extreme uncertainty is modelled using long-tail probability distributions. There have been many queuing analyses for a single server queue fed by an M/G/traffic process, in which G is a Pareto distribution, that focus on certain limiting conditions. In this paper, we present a mathematical model to solve an infinite queuing system with one server where the inter-arrival time between jobs follows a Pareto probability distribution with shape parameter α and a scale parameter A. The system service time is also a Pareto probability distribution with shape parameter β and scale parameter B. We call this the P/P/1 queuing model.











