A simple approximation for the Erlang loss function

DOI10.1016/0166-5316(92)90031-BMaRDI QIDQ4030464zbMATH OpenOpenAlexFDO

Authors Eugene Pinsky

Publication date 1 April 1993

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(92)90031-b

zbMATH Keywords

\(M/M/N/N\) queueing systemErlang loss functionperformance evaluation

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• On the Erlang loss function
• A simple algebraic approximation to the Erlang loss system
• Improved approximations for the Erlang loss model
• The evergreen Erlang loss function
• On the continued Erlang loss function
• Convexity Properties of the Erlang Loss Formula
• On the nonstationary Erlang loss model
• Loss functions for loss estimation
• On the Erlang loss model with time dependent input
• Complexity of simple nonlogarithmic loss functions

Cited in

(12)

• A simple algebraic approximation to the Erlang loss system
• On the continued Erlang loss function
• Error bounds for asymptotic approximations of the partition function
• Improved approximations for the Erlang loss model
• On a bicriterion server allocation problem in a multidimensional Erlang loss system
• Convexity Properties of the Erlang Loss Formula
• Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
• A generalization of the Erlang's B formula
• scientific article; zbMATH DE number 1263802 (Why is no real title available?)
• Computing erlang–b function derivatives in the number of servers
• A new method for computing Erlang-B formula
• The evergreen Erlang loss function

This page was built for publication: A simple approximation for the Erlang loss function

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