Finite-pool queueing with heavy-tailed services
From MaRDI portal
Abstract: We consider the queue, in which a a total of customers independently demand service after an exponential time. We focus on the case of heavy-tailed service times, and assume that the tail of the service time distribution decays like , with . We consider the asymptotic regime in which the population size grows to infinity and establish that the scaled queue length process converges to an alpha-stable process with a negative quadratic drift. We leverage this asymptotic result to characterize the headstart that is needed to create a long period of activity. This result should be contrasted with the case of light-tailed service times, which was shown to have a similar scaling limit, but then with a Brownian motion instead of an alpha-stable process.
Recommendations
Cites work
- A queueing model with independent arrivals, and its fluid and diffusion limits
- Applied Probability and Queues
- Asymptotic Analysis of the Time Dependent M/M/1 Queue
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Cluster tails for critical power-law inhomogeneous random graphs
- Critical epidemics, random graphs, and Brownian motion with a parabolic drift
- Critical window for the configuration model: finite third moment degrees
- Heavy-traffic limits for a single-server queue leading up to a critical point
- Hitting densities for spectrally positive stable processes
- scientific article; zbMATH DE number 614990 (Why is no real title available?)
- scientific article; zbMATH DE number 4000257 (Why is no real title available?)
- scientific article; zbMATH DE number 1834045 (Why is no real title available?)
- scientific article; zbMATH DE number 1402217 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- Large deviations for power-law thinned Lévy processes
- Large finite population queueing systems: The single-server model
- Multiple channel queues in heavy traffic. I
- Multiple channel queues in heavy traffic. II: sequences, networks, and batches
- Novel scaling limits for critical inhomogeneous random graphs
- On the largest component of the random graph at a nearcritical stage
- Order Statistics
- Probability theory. A comprehensive course.
- Queues with time-dependent arrival rates. III — A mild rush hour
- Stochastic-Process Limits
- Strong Approximations for Time-Dependent Queues
- The component sizes of a critical random graph with given degree sequence
- The maximum of Brownian motion minus a parabola
- The maximum of Brownian motion with parabolic drift
Cited in
(5)- An alternative approach to heavy-traffic limits for finite-pool queues
- Queue length asymptotics for the multiple-server queue with heavy-tailed Weibull service times
- Weighted Dyck paths and nonstationary queues
- Big jobs arrive early: from critical queues to random graphs
- Extending the Service Domain of an Interactive Bounded Queue
This page was built for publication: Finite-pool queueing with heavy-tailed services
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4684899)