Sharp and simple bounds for the Erlang delay and loss formulae
DOI10.1007/S11134-009-9152-7zbMATH Open1182.90024OpenAlexW2148179212MaRDI QIDQ2268464FDOQ2268464
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
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
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)
Cites Work
- On the Lambert \(w\) function
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
- Title not available (Why is that?)
- A note on the convexity of performance measures of M/M/c queueing systems
- Title not available (Why is that?)
- Some Properties of the Erlang Loss Function
- Corrected asymptotics for a multi-server queue in the Halfin-Whitt regime
- Strong Convexity Results for Queueing Systems
- Convexity Properties of the Erlang Loss Formula
- The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
- Note—Simple Inequalities for Multiserver Queues
- On the Inverse of Erlang's Function
- A simple algebraic approximation to the Erlang loss system
- Asymptotic inversion of the Erlang B formula
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)
