Batch sojourn time in the processor sharing queue with geometric batch size

DOI10.1080/15326349.2021.1913422zbMath1471.60144arXiv2009.13254OpenAlexW3157589549MaRDI QIDQ5157349

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

Publication date: 13 October 2021

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

Full work available at URL: https://arxiv.org/abs/2009.13254

zbMATH Keywords

Laplace transformsojourn timeprocessor sharinginfinite linear systembatch \(\mathbf{M}/\mathbf{M}/1\) queue

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The waiting time distribution for the random order service \(M/M/1\) queue
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• The equivalence between processor sharing and service in random order.
• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
• Extinction Probabilities for a Distylous Plant Population Modeled by an Inhomogeneous Random Walk on the Positive Quadrant
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• Response-Time Distribution for a Processor-Sharing System
• Sojourn time in a Processor Sharing queue with batch arrivals
• Multiple Hypergeometric Series: Appell Series and Beyond
• Waiting Time Distributions for Processor-Sharing Systems
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals

This page was built for publication: Batch sojourn time in the processor sharing queue with geometric batch size