Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
From MaRDI portal
Publication:3798014
Recommendations
- Sharp and simple bounds for the Erlang delay and loss formulae
- On a bicriterion server allocation problem in a multidimensional Erlang loss system
- A simple algebraic approximation to the Erlang loss system
- A simple approximation for the Erlang loss function
- Some allocation problems for critically loaded loss systems with independent links
Cited in
(14)- A simple algebraic approximation to the Erlang loss system
- On product form approximations for communication networks with losses: Error bounds
- The evergreen Erlang loss function
- Delay-minimizing capacity allocation in an infinite server-queueing system
- Second-order properties of the loss probability in \(M/M/s/s+c\) systems
- Some properties of the delay probability in \(M/M/s/s+c\) systems
- Capacity expansion for a loss system with exponential demand growth.
- Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem
- Service staffing with delay probabilities
- Sharp and simple bounds for the Erlang delay and loss formulae
- Asymptotic inversion of the Erlang B formula
- Allocation of Servers for Stochastic Service Stations with One Overflow Station
- Threshold properties of the \(M/M/1\) queue under T-policy with applications
- Optimality gap of asymptotically derived prescriptions in queueing systems, \(o(1)\)-optimality
This page was built for publication: Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798014)
