Explicit formulas for the variance of conditioned sojourn times in M/D/1-PS

DOI10.1016/J.ORL.2006.08.006MaRDI QIDQ2457262zbMATH OpenOpenAlexFDO

Authors Michael Shalmon

Publication date 30 October 2007

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2006.08.006

zbMATH Keywords

branchingprocessor sharingsojourn timesvariance

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• On sojourn times in the M/M/1-PS model, conditioned on the number of other users
• SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
• Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
• The sojourn time in the GI/M/1 queue by processor sharing
• Conditional sojourn times of processor-sharing queues

Cites work

• A new approach to the M/G/1 processor-sharing queue
• scientific article; zbMATH DE number 3823138 (Why is no real title available?)
• Processor-sharing queues: Some progress in analysis
• Sojourn time asymptotics in the M/G/1 processor sharing queue
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• Waiting Time Distributions for Processor-Sharing Systems

Cited in

(1)

• Processor sharing: a survey of the mathematical theory

This page was built for publication: Explicit formulas for the variance of conditioned sojourn times in \(M/D/1\)-PS

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