Tail behavior of conditional sojourn times in processor-sharing queues
DOI10.1007/S11134-006-9007-4zbMATH Open1178.90093OpenAlexW2146911573MaRDI QIDQ877791FDOQ877791
Authors: Regina Egorova, Bert Zwart 
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
Recommendations
- Conditional sojourn times of processor-sharing queues
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- Tail asymptotics for processor-sharing queues
- Sojourn time asymptotics in processor-sharing queues
- On the sojourn time distribution in a finite capacity processor shared queue
- The conditional sojourn time distribution in the \(GI/M/1\) processor- sharing queue in heavy traffic
- Sojourn time distribution in some processor-shared queues
- Large deviations of sojourn times in processor sharing queues
- CONCAVITY OF THE CONDITIONAL MEAN SOJOURN TIME IN THE PROCESSOR-SHARING QUEUE WITH BATCH ARRIVALS
- Sojourn time asymptotics in processor sharing queues with varying service rate
tail behaviorbranching processessojourn timerandom sumsprocessor sharingM/G/1 queueexponential asymptoticsLaplace-Stieltjes transforms
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- A new approach to the M/G/1 processor-sharing queue
- The sojourn-time distribution in the M/G/1 queue by processor sharing
- Title not available (Why is that?)
- Waiting Time Distributions for Processor-Sharing Systems
- On a Theorem of Breiman and a Class of Random Difference Equations
- Sojourn time asymptotics in processor-sharing queues
- On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
- The Fourier-series method for inverting transforms of probability distributions
- Processor-sharing queues: Some progress in analysis
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- Asymptotics for M/G/1 low-priority waiting-time tail probabilities
- Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
- On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
- An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
- The waiting time distribution for the random order service \(M/M/1\) queue
- The equivalence between processor sharing and service in random order.
- Tails of waiting times and their bounds
- A large-deviations analysis of the GI/GI/1 SRPT queue
- Large deviations of sojourn times in processor sharing queues
- Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
- SOJOURN TIMES IN THE M/G/1 FB QUEUE WITH LIGHT-TAILED SERVICE TIMES
Cited In (11)
- Queues with equally heavy sojourn time and service requirement distributions
- Sojourn time in a \(M^{[X]}/M/1\) processor sharing queue with batch arrivals
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- 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
- Conditional expected sojourn times in insensitive queueing systems and networks
- The Conditional Sojourn Time Distribution in the GI/M/1 Processor-Sharing Queue in Heavy Traffic
- Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue
- Tail asymptotics for processor-sharing queues
- Sojourn time asymptotics in processor-sharing queues
- CONCAVITY OF THE CONDITIONAL MEAN SOJOURN TIME IN THE PROCESSOR-SHARING QUEUE WITH BATCH ARRIVALS
This page was built for publication: Tail behavior of conditional sojourn times in processor-sharing queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877791)
