Sharp and simple bounds for the Erlang delay and loss formulae

DOI10.1007/S11134-009-9152-7MaRDI QIDQ2268464zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
• Convexity results for the Erlang delay and loss formulae when the server utilization is held constant
• scientific article; zbMATH DE number 4070002
• Monotonicity and error bounds for networks of Erlang loss queues
• Publication:4726026
• On the shortest queue version of the Erlang loss model
• Delay on Broadcast Erasure Channels Under Random Linear Combinations
• Delay Asymptotics With Retransmissions and Incremental Redundancy Codes Over Erasure Channels
• Asymptotic properties of delay-time-weighted probability of error (Corresp.)
• A simple algebraic approximation to the Erlang loss system

Cites work

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

Cited in

(9)

• Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
• On the Erlang loss function
• Optimality gap of asymptotically derived prescriptions in queueing systems, \(o(1)\)-optimality
• Convexity results for the Erlang delay and loss formulae when the server utilization is held constant
• Threshold properties of the \(M/M/1\) queue under T-policy with applications
• A note on the convexity of the expected queue length of the \(M/M/s\) queue with respect to the arrival rate: A third proof
• On the accuracy of the OPC approximation for a symmetric overflow loss model
• Technical note -- A near-optimal algorithm for real-time order acceptance: an application in postacute healthcare services
• Erlang loss bounds for OT-ICU systems

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

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