Sojourn time asymptotics in processor-sharing queues
This survey paper gives an overview of several methods used in investigating queues with processor-sharing (PS) discipline in case of heavy-tailed service requirements. In this case there exists a simple asymptotic equivalence between the sojourn time and the service requirement distribution, which is commonly referred to as a reduced service rate approximation. The paper considers Tauberian approach, sample-path large-deviations approach, and probabilistic approach using the conditional sojourn time. It also contains the generalization of the reduced service rate approximation to several extensions of the M/G/1 PS queue. In addition, it identifies a relationship between the reduced service rate approximation and a queue length distribution with a geometrically decaying tail, and extends it to so-called bandwidth-sharing networks. It also touches PS queues with light-tailed service requirements. The paper also proposes some possible avenues for further research.
- A large-deviations analysis of the GI/GI/1 SRPT queue
- An Analysis of the M/G/1 Queue Under Round-Robin Scheduling
- Analysis of A time‐shared processor
- Applied Probability and Queues
- Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes
- Asymptotic properties of supercritical branching processes I: The Galton-Watson process
- Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes
- scientific article; zbMATH DE number 3943021 (Why is no real title available?)
- scientific article; zbMATH DE number 1466126 (Why is no real title available?)
- scientific article; zbMATH DE number 4000257 (Why is no real title available?)
- scientific article; zbMATH DE number 3238248 (Why is no real title available?)
- scientific article; zbMATH DE number 3106542 (Why is no real title available?)
- Insensitive bandwidth sharing in data networks
- Insensitivity in processor-sharing networks
- Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
- Large deviations of sojourn times in processor sharing queues
- Mathematical problems in the theory of processor-sharing queueing systems
- On stochastic bounds for monotonic processor sharing networks
- Preventing Large Sojourn Times Using SMART Scheduling
- Processor-sharing queues: Some progress in analysis
- Queues with equally heavy sojourn time and service requirement distributions
- Reduced load equivalence under subexponentiality
- Response-Time Distribution for a Processor-Sharing System
- Sampling at a random time with a heavy-tailed distribution
- Sampling at subexponential times, with queueing applications
- Sharing a Processor Among Many Job Classes
- Sojourn time asymptotics in the M/G/1 processor sharing queue
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- Tail asymptotics for processor-sharing queues
- Tail asymptotics for the busy period in the \(GI/G/1\) queue.
- The M/G/1 queue with processor sharing and its relation to a feedback queue
- The equivalence between processor sharing and service in random order.
- The gi/m/1 processor-sharing queue and its heavy traffic analysis
- The sojourn time in the GI/M/1 queue by processor sharing
- The sojourn-time distribution in the M/G/1 queue by processor sharing
- The waiting time distribution for the random order service M/M/1 queue
- Time-shared Systems
- Waiting Time Distributions for Processor-Sharing Systems
- A note on the event horizon for a processor sharing queue
- The equivalence between processor sharing and service in random order.
- Sojourn times in a processor sharing queue with service interruptions
- Sojourn times in a random queue with and without preemption
- Sojourn time asymptotics in a parking lot network
- Open problems in queueing theory inspired by datacenter computing
- Sojourn time asymptotics in processor sharing queues with varying service rate
- Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
- Large deviations of sojourn times in processor sharing queues
- A survey on discriminatory processor sharing
- Sojourn times in the \(M/ PH/1\) processor sharing queue
- Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines
- Asymptotic Expansions of Moments of the Waiting Time in a Shared-Processor of an Interactive System
- CONCAVITY OF THE CONDITIONAL MEAN SOJOURN TIME IN THE PROCESSOR-SHARING QUEUE WITH BATCH ARRIVALS
- Ratio between average sojourn times under processor sharing and fair sojourn protocol
- ASYMPTOTIC PROPERTIES OF SOJOURN TIMES IN MULTICLASS TIME-SHARED SYSTEMS
- Additive functionals with application to sojourn times in infinite-server and processor sharing systems
- Sojourn times in a processor sharing queue with multiple vacations
- Waiting time distributions for M/M/N processor sharing queues
- scientific article; zbMATH DE number 1466126 (Why is no real title available?)
- Sojourn time analysis for processor sharing loss system with unreliable server
- Tail asymptotics for processor-sharing queues
- On the sojourn of an arbitrary customer in an \(M/M/1\) processor sharing queue
- Delay analysis of the max-weight policy under heavy-tailed traffic via fluid approximations
- Asymptotic behavior of generalized processor sharing queues under subexponential assumptions
- Tail behavior of conditional sojourn times in processor-sharing queues
- Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue
This page was built for publication: Sojourn time asymptotics in processor-sharing queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494559)
