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

DOI10.1080/15326349.2017.1392868zbMath1386.60317OpenAlexW2793810923MaRDI QIDQ4639232

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)

Related Items (1)

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.
• A new approach to the M/G/1 processor-sharing queue
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• Recurrence relations, continued fractions, and orthogonal polynomials
• Response-Time Distribution for a Processor-Sharing System
• On Sieved Orthogonal Polynomials. V: Sieved Pollaczek Polynomials
• Time-shared Systems
• Waiting Time Distributions for Processor-Sharing Systems
• Analysis of the M/M/1 queue with processor sharing via spectral theory

This page was built for publication: Sojourn time in an M/M/1 processor sharing queue with permanent customers