Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO

DOI10.2307/3214199zbMath0602.60085OpenAlexW4251282717MaRDI QIDQ3738369

Robert B. Cooper, Shun-Chen Niu

Publication date: 1986

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

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

zbMATH Keywords

waiting time distributionPollaczek-Chintchin-formula

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

Processor-sharing queues: Some progress in analysis ⋮ Representing workloads in GI/G/1 queues through the preemptive-resume LIFO queue discipline ⋮ Time-dependent properties of symmetric queues ⋮ Processor sharing: a survey of the mathematical theory ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ On the subexponential properties in stationary single-server queues: a Palm-martingale approach ⋮ A LCFS finite buffer model with batch input and non-exponential services ⋮ Analysis of the GI/GI/1 Queue and its Variations via the LCFS Preemptive Resume Discipline and Its Random Walk Interpretation

This page was built for publication: Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO