Sojourn time in an M/M/1 processor sharing queue with permanent customers

DOI10.1080/15326349.2017.1392868MaRDI QIDQ4639232zbMATH OpenOpenAlexFDO

Authors Farah Slim, Fabrice M. Guillemin

Publication date 3 May 2018

Published in Stochastic Models (Search for Journal in Brave)

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

zbMATH Keywords

sojourn timepermanent customersprocessor sharing: \(\mathrm{M}/\mathrm{M}/1\) queue

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Recommendations

• Sojourn time distribution in some processor-shared queues
• On sojourn times in the \(M/M/1\)-PS model, conditioned on the number of other users
• On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
• The Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing Service
• Sojourn times in the \(M/ PH/1\) processor sharing queue

Cites work

• scientific article; zbMATH DE number 3823138 (Why is no real title available?)
• scientific article; zbMATH DE number 3943021 (Why is no real title available?)
• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• A new approach to the M/G/1 processor-sharing queue
• Analysis of the M/M/1 queue with processor sharing via spectral theory
• On Sieved Orthogonal Polynomials. V: Sieved Pollaczek Polynomials
• Recurrence relations, continued fractions, and orthogonal polynomials
• Response-Time Distribution for a Processor-Sharing System
• The equivalence between processor sharing and service in random order.
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• The waiting time distribution for the random order service M/M/1 queue
• Time-shared Systems
• Waiting Time Distributions for Processor-Sharing Systems

Cited in

(4)

• Calculation of the customer's sojourn time distribution function in \(\mathrm{M}/{\mathrm{G}_N}/1\) queue with customized services using roots method
• Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
• Analysis of the M/M/1 queue with processor sharing via spectral theory
• On the sojourn of an arbitrary customer in an \(M/M/1\) processor sharing queue

This page was built for publication: Sojourn time in an \(\mathrm{M}/\mathrm{M}/1\) processor sharing queue with permanent customers

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