Tail behavior of conditional sojourn times in processor-sharing queues
From MaRDI portal
Publication:877791
DOI10.1007/s11134-006-9007-4zbMath1178.90093OpenAlexW2146911573MaRDI QIDQ877791
Publication date: 3 May 2007
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/10864
branching processesrandom sumstail behaviorsojourn timeM/G/1 queueLaplace-Stieltjes transformsprocessor sharingexponential asymptotics
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (3)
Asymptotic expansions of defective renewal equations with applications to perturbed risk models and processor sharing queues ⋮ Tail asymptotics of the waiting time and the busy period for the \(\mathrm{M}/\mathrm{G}/1/K\) queues with subexponential service times ⋮ Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue
Cites Work
- Unnamed Item
- Unnamed Item
- A large-deviations analysis of the GI/GI/1 SRPT queue
- Processor-sharing queues: Some progress in analysis
- The Fourier-series method for inverting transforms of probability distributions
- The waiting time distribution for the random order service \(M/M/1\) queue
- Asymptotics for M/G/1 low-priority waiting-time tail probabilities
- The equivalence between processor sharing and service in random order.
- Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
- Tails of waiting times and their bounds
- Large deviations of sojourn times in processor sharing queues
- Sojourn time asymptotics in processor-sharing queues
- On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
- A new approach to the M/G/1 processor-sharing queue
- The sojourn-time distribution in the M/G/1 queue by processor sharing
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
- On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
- SOJOURN TIMES IN THE M/G/1 FB QUEUE WITH LIGHT-TAILED SERVICE TIMES
- On a Theorem of Breiman and a Class of Random Difference Equations
- Waiting Time Distributions for Processor-Sharing Systems
- Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
This page was built for publication: Tail behavior of conditional sojourn times in processor-sharing queues