Server sharing with a limited number of service positions and symmetric queues

DOI10.2307/3214221zbMath0638.60098OpenAlexW4252691896MaRDI QIDQ3779553

Benjamin Avi-Itzhak, Shlomo Halfin

Publication date: 1987

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214221

zbMATH Keywords

Laplace transformvariance reductionprocessor sharingsteady state distributioninsensitive queueswaiting time variances

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 (6)

Asymptotic Analysis of Spectral Properties of Finite Capacity Processor Shared Queues ⋮ Processor sharing: a survey of the mathematical theory ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Performance analysis of a multiprogramming-multiprocessor retrial queueing system with orderly reattempts ⋮ Monotonicity in the Limited Processor-Sharing Queue ⋮ Response times in gated M/G/1 queues: The processor-sharing case

This page was built for publication: Server sharing with a limited number of service positions and symmetric queues