Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals

DOI10.1007/S11134-007-9058-1MaRDI QIDQ2481137zbMATH OpenOpenAlexFDO

Authors Jeongsim Kim, Bara Kim

Publication date 14 April 2008

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11134-007-9058-1

zbMATH Keywords

batch arrivalsconcavityprocessor-sharingsojourn time

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Queues and service in operations research (90B22)

Recommendations

• CONCAVITY OF THE CONDITIONAL MEAN SOJOURN TIME IN THE PROCESSOR-SHARING QUEUE WITH BATCH ARRIVALS
• Sojourn time asymptotics in the M/G/1 processor sharing queue
• Batch sojourn time in the \(M^{[X]}/M/1\) processor sharing queue with geometric batch size
• The conditional sojourn time distribution in the GI/M/1 processor- sharing queue in heavy traffic
• On sojourn times in the M/M/1-PS model, conditioned on the number of other users

Cites work

• GI/G/1 processor sharing queue in heavy traffic
• A new approach to the M/G/1 processor-sharing queue
• An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• Asymptotic approximations for the gi/m/1 queue with processor-sharing service
• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
• Conditional response times in the M/G/1 processor-sharing system
• Processor-sharing queues: Some progress in analysis
• Sojourn time distribution in a MAP/M/1 processor-sharing queue
• The gi/m/1 processor-sharing queue and its heavy traffic analysis
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals
• 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
• Time-shared Systems
• Waiting Time Distributions for Processor-Sharing Systems

Cited in

(3)

• CONCAVITY OF THE CONDITIONAL MEAN SOJOURN TIME IN THE PROCESSOR-SHARING QUEUE WITH BATCH ARRIVALS
• Sojourn times in a processor sharing queue with multiple vacations
• Batch processor sharing with hyper-exponential service time

This page was built for publication: Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals

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