Asymptotic expansions for the sojourn time distribution in the M/G/1-PS queue

DOI10.1007/S00186-009-0290-9MaRDI QIDQ966424zbMATH OpenOpenAlexFDO

Authors Qiang Zhen, Charles Knessl

Publication date 23 April 2010

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0902.1199

zbMATH Keywords

\(M/G/1\)-PS queueasymptoticsprocessor sharingsojourn time

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Control/observation systems involving computers (process control, etc.) (93C83) Stochastic systems in control theory (general) (93E03)

Abstract: We consider the $M/G/1$ queue with a processor sharing server. We study the conditional sojourn time distribution, conditioned on the customer's service requirement, as well as the unconditional distribution, in various asymptotic limits. These include large time and/or large service request, and heavy traffic, where the arrival rate is only slightly less than the service rate. Our results demonstrate the possible tail behaviors of the unconditional distribution, which was previously known in the cases $G=M$ and $G=D$ (where it is purely exponential). We assume that the service density decays at least exponentially fast. We use various methods for the asymptotic expansion of integrals, such as the Laplace and saddle point methods.

Recommendations

• Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS 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
• Sojourn time asymptotics in the M/G/1 processor sharing queue
• The Conditional Sojourn Time Distribution in the GI/M/1 Processor-Sharing Queue in Heavy Traffic

Cites work

• An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
• Analysis of A time‐shared processor
• Analysis of the M/M/1 queue with processor sharing via spectral theory
• Asymptotic approximations for the gi/m/1 queue with processor-sharing service
• Asymptotic approximations of integrals
• Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
• scientific article; zbMATH DE number 3174016 (Why is no real title available?)
• scientific article; zbMATH DE number 3943021 (Why is no real title available?)
• scientific article; zbMATH DE number 3512673 (Why is no real title available?)
• scientific article; zbMATH DE number 3106542 (Why is no real title available?)
• Large deviations of sojourn times in processor sharing queues
• Mathematical problems in the theory of processor-sharing queueing systems
• On processor sharing and random service
• Processor sharing: a survey of the mathematical theory
• Processor-sharing queues: Some progress in analysis
• Response-Time Distribution for a Processor-Sharing System
• Sojourn time asymptotics in processor-sharing queues
• Sojourn time asymptotics in the M/G/1 processor sharing queue
• SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
• Tail behavior of conditional sojourn times in processor-sharing queues
• The equivalence between processor sharing and service in random order.
• 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

Cited in

(10)

• Sojourn time asymptotics in the M/G/1 processor sharing queue
• Modeling and optimization of M/G/1-type queueing networks: an efficient sensitivity analysis approach
• Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
• On sojourn times in the M/M/1-PS model, conditioned on the number of other users
• Tail asymptotics of the waiting time and the busy period for the \(\mathrm{M}/\mathrm{G}/1/K\) queues with subexponential service times
• scientific article; zbMATH DE number 1457525 (Why is no real title available?)
• ON THE SERIES EXPANSION FOR THE STATIONARY PROBABILITIES OF AN M/D/1 QUEUE
• Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
• Asymptotic expansions of defective renewal equations with applications to perturbed risk models and processor sharing queues
• Asymptotic analysis of the sojourn time of a batch in a M ^{[ X ]} / M /1 processor sharing queue

This page was built for publication: Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966424)