A simple algebraic approximation to the Erlang loss system

DOI10.1016/J.ORL.2007.10.010zbMath1158.60375OpenAlexW2027476515MaRDI QIDQ1003502

Daniel Adelman

Publication date: 4 March 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.10.010

zbMATH Keywords

approximationPalm calculusErlang loss probability

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (2)

Performance optimization of open zero-buffer multi-server queueing networks ⋮ Sharp and simple bounds for the Erlang delay and loss formulae

Cites Work

• Unnamed Item
• Unnamed Item
• Price-Directed Control of a Closed Logistics Queueing Network
• Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
• Note—Comments on a Queueing Inequality
• Note—Simple Inequalities for Multiserver Queues
• Capacity Management in Rental Businesses with Two Customer Bases

This page was built for publication: A simple algebraic approximation to the Erlang loss system