Sharp and simple bounds for the Erlang delay and loss formulae

DOI10.1007/s11134-009-9152-7zbMath1182.90024OpenAlexW2148179212MaRDI QIDQ2268464

Arie Harel

Publication date: 8 March 2010

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-009-9152-7

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Management decision making, including multiple objectives (90B50) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Production models (90B30)

Related Items (4)

Optimality gap of asymptotically derived prescriptions in queueing systems, \(o(1)\)-optimality ⋮ Threshold properties of the \(M/M/1\) queue under T-policy with applications ⋮ Technical Note—A Near-Optimal Algorithm for Real-Time Order Acceptance: An Application in Postacute Healthcare Services ⋮ On the Accuracy of the OPC Approximation for a Symmetric Overflow Loss Model

Cites Work

• Unnamed Item
• Unnamed Item
• The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
• Corrected asymptotics for a multi-server queue in the Halfin-Whitt regime
• A simple algebraic approximation to the Erlang loss system
• On the Lambert \(w\) function
• A note on the convexity of performance measures of M/M/c queueing systems
• Convexity Properties of the Erlang Loss Formula
• Strong Convexity Results for Queueing Systems
• Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
• Heavy-Traffic Limits for Queues with Many Exponential Servers
• Note—Simple Inequalities for Multiserver Queues
• On the Inverse of Erlang's Function
• Some Properties of the Erlang Loss Function
• Asymptotic Inversion of the Erlang B Formula

This page was built for publication: Sharp and simple bounds for the Erlang delay and loss formulae