A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates

DOI10.1287/MOOR.3.1.10MaRDI QIDQ4181071zbMATH OpenOpenAlexFDO

Authors Shelby Brumelle

Publication date 1978

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.3.1.10

zbMATH Keywords

Birth-Death ProcessesErlang Loss SystemProcessor Shared SystemsStationary Probability Distributions

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Cited in

(14)

• Stationary queuing systems with dependencies
• Duality between the Erlang loss system and a finite source queue
• Analysis of \(GI/ M/ n/ n\) queueing system with ordered entry and no waiting line
• A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline
• Duality between the \(M/G/s/s\) and \(GI/M/1/s/s\) queues
• History of Queueing Theory in Canada Prior to 1980
• Technical note -- Static pricing: universal guarantees for reusable resources
• Insensitivity of the mean field limit of loss systems under \(\mathrm{SQ}(d)\) routeing
• An inventory model with unidirectional lateral transshipments
• Simple modeling techniques for base-stock inventory systems with state dependent demand rates
• Mathematical problems in the theory of processor-sharing queueing systems
• An inventory model with discounts for omnichannel retailers of slow moving items
• Computing the conditional entry-state distribution in Erlang loss systems
• On the cycle maximum of birth-death processes and networks of queues

This page was built for publication: A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4181071)