Asymptotic analysis of the sojourn time of a batch in a M [ X ] / M /1 processor sharing queue

DOI10.1080/15326349.2024.2317210MaRDI QIDQ6646223

Fabrice M. Guillemin, Veronica Quintuna Rodriguez, Ridha Nasri, Alain Simonian

Publication date: 29 November 2024

Published in: Stochastic Models (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
• Sojourn time in a Processor Sharing queue with batch arrivals
• Batch sojourn time in the processor sharing queue with geometric batch size
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals

This page was built for publication: Asymptotic analysis of the sojourn time of a batch in a M ^{[ X ]} / M /1 processor sharing queue

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