An extremal property of the fifo discipline via an ordinal version of

DOI10.1080/15326348908807121zbMath0677.60101OpenAlexW1983864452MaRDI QIDQ3833400

Ward Whitt, Shlomo Halfin

Publication date: 1989

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

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

zbMATH Keywords

processor sharingLittle's formulaconservation law for single-server queueslong-run average number of arrivalspreemptive service-sharing disciplines

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

Little laws for utility processes and waiting times in queues ⋮ Optimal scheduling policies in time sharing service systems ⋮ A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline ⋮ A Palm calculus approach to functional versions of Little's law ⋮ Sample-path analysis of processes with imbedded point processes ⋮ A review of \(L=\lambda W\) and extensions