Sojourn time in a Processor Sharing queue with batch arrivals

DOI10.1080/15326349.2018.1479270zbMath1403.60077OpenAlexW2898503766MaRDI QIDQ4646609

Alain Simonian, Veronika Karina Quintuna Rodriguez, 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

performance analysislimit distributionscomplex analysiscloud computingqueuing models

Mathematics Subject Classification ID

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

Related Items (5)

Optimal pricing and capacity sizing for online service systems with free trials ⋮ Analysis of a queueing system with mixed service discipline ⋮ Batch sojourn time in the processor sharing queue with geometric batch size ⋮ A new linear inversion formula for a class of hypergeometric polynomials ⋮ On the sojourn of an arbitrary customer in an M/M/1 Processor Sharing Queue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The waiting time distribution for the random order service \(M/M/1\) queue
• The equivalence between processor sharing and service in random order.
• Probability essentials.
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals
• Analysis of the M/M/1 queue with processor sharing via spectral theory

This page was built for publication: Sojourn time in a Processor Sharing queue with batch arrivals