The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue

DOI10.2307/3214245zbMath0642.60080OpenAlexW2335771636MaRDI QIDQ3784956

R. Schassberger

Publication date: 1988

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

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

zbMATH Keywords

infinite divisibilitysteady-state distributionbatch arrivalstime-sharing

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) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (7)

Processor-sharing queues: Some progress in analysis ⋮ Processor sharing: a survey of the mathematical theory ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ A finite capacity \(BMAPK/GK/1\) queue with the generalized foreground-background processor-sharing discipline ⋮ On the M/G/1 foreground-background processor-sharing queue ⋮ Stability of an M\(|G|1\) queue with thick tails and excess capacity ⋮ The M/G/1 processor-sharing model: Transient behavior

This page was built for publication: The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue