Sojourn time in a M^[X]/M/1 processor sharing queue with batch arrivals

DOI10.1080/15326349.2018.1479270MaRDI QIDQ4646609zbMATH OpenOpenAlexWikidataFDO

Authors Veronika Karina Quintuna Rodriguez, Alain Simonian, Fabrice M. Guillemin

Publication date 14 January 2019

Published in Stochastic Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15326349.2018.1479270

zbMATH Keywords

limit distributionscloud computingperformance analysiscomplex analysisqueuing models

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Batch sojourn time in the \(M^{[X]}/M/1\) processor sharing queue with geometric batch size
• SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
• Sojourn times in the \(M/ PH/1\) processor sharing queue
• Tail behavior of conditional sojourn times in processor-sharing queues
• Sojourn time asymptotics in the M/G/1 processor sharing queue

Cites work

• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 3081880 (Why is no real title available?)
• Analysis of the M/M/1 queue with processor sharing via spectral theory
• NIST handbook of mathematical functions
• Probability essentials.
• The equivalence between processor sharing and service in random order.
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals
• The waiting time distribution for the random order service M/M/1 queue

Cited in

(12)

• Batch processor sharing with hyper-exponential service time
• Sojourn times in a processor sharing queue with service interruptions
• Optimal pricing and capacity sizing for online service systems with free trials
• Sojourn-time distribution for \(M/G^a/1\) queue with batch service of fixed size -- revisited
• On the sojourn of an arbitrary customer in an \(M/M/1\) processor sharing queue
• Analysis of a queueing system with mixed service discipline
• A new linear inversion formula for a class of hypergeometric polynomials
• Asymptotic analysis of the sojourn time of a batch in a M ^{[ X ]} / M /1 processor sharing queue
• Batch arrival single-server queue with variable service speed and setup time
• Sojourn times in a processor sharing queue with multiple vacations
• CONCAVITY OF THE CONDITIONAL MEAN SOJOURN TIME IN THE PROCESSOR-SHARING QUEUE WITH BATCH ARRIVALS
• Batch sojourn time in the \(M^{[X]}/M/1\) processor sharing queue with geometric batch size

This page was built for publication: Sojourn time in a \(M^{[X]}/M/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 Q4646609)