Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
From MaRDI portal
Publication:2479860
DOI10.1007/s11134-007-9054-5zbMath1176.90135arXiv0907.2910OpenAlexW3099340451MaRDI QIDQ2479860
Publication date: 3 April 2008
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.2910
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Probabilistic games; gambling (91A60)
Related Items
On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes ⋮ On a processor sharing queue that models balking ⋮ 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
- Unnamed Item
- Unnamed Item
- Processor-sharing queues: Some progress in analysis
- Mathematical problems in the theory of processor-sharing queueing systems
- The waiting time distribution for the random order service \(M/M/1\) queue
- The equivalence between processor sharing and service in random order.
- Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
- Large deviations of sojourn times in processor sharing queues
- Sojourn time asymptotics in processor-sharing queues
- Asymptotic Approximations of Integrals
- 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
- Response-Time Distribution for a Processor-Sharing System
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- On processor sharing and random service
- Analysis of A time‐shared processor
- Time-shared Systems
- Waiting Time Distributions for Processor-Sharing Systems
