Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
From MaRDI portal
Publication:5704142
Recommendations
- Large deviations of sojourn times in processor sharing queues
- Asymptotic expansions for waiting time probabilities in an \(M/G/1\) queue with long-tailed service time
- Uniform approximations for the \(M/G/1\) queue with subexponential processing times
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue
Cited in
(21)- Processor sharing: a survey of the mathematical theory
- Asymptotic expansions for waiting time probabilities in an \(M/G/1\) queue with long-tailed service time
- Large deviations of sojourn times in processor sharing queues
- Heavy-tailed limits for medium size jobs and comparison scheduling
- Asymptotic Expansions of Moments of the Waiting Time in a Shared-Processor of an Interactive System
- Asymptotic Expansion of the Waiting Time Distribution of Two Models of a Closed Processor-Sharing System: Heavy Usage
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- On the generalization of the hazard rate twisting-based simulation approach
- Sojourn time asymptotics in processor sharing queues with varying service rate
- Instability of sharing systems in the presence of retransmissions
- Reduced-load equivalence for queues with Gaussian input
- Characterizing heavy-tailed distributions induced by retransmissions
- AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
- Tail behavior of conditional sojourn times in processor-sharing queues
- Delay analysis of the max-weight policy under heavy-tailed traffic via fluid approximations
- Tail asymptotics for processor-sharing queues
- Sample path large deviations for Lévy processes and random walks with Weibull increments
- Sojourn time asymptotics in processor-sharing queues
- Heavy Tails in Queueing Systems: Impact of Parallelism on Tail Performance
- Asymptotic behavior of generalized processor sharing queues under subexponential assumptions
- Uniform approximations for the \(M/G/1\) queue with subexponential processing times
This page was built for publication: Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704142)