A simple algebraic approximation to the Erlang loss system

Authors:
Daniel Adelman
Affiliations:
University of Chicago, Graduate School of Business, United States
Venue:
Operations Research Letters
Year:
2008

Citing 4
Cited 3

Sharp bounds and simple approximations for the Erlang delay and loss formulas

Management Science
Capacity Management in Rental Businesses with Two Customer Bases

Operations Research
Price-Directed Control of a Closed Logistics Queueing Network

Operations Research
Optimal prices for finite capacity queueing systems

Operations Research Letters

Performance optimization of open zero-buffer multi-server queueing networks

Computers and Operations Research
Sharp and simple bounds for the Erlang delay and loss formulae

Queueing Systems: Theory and Applications
Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We use Palm calculus to derive a simple, intuitive system of two linear-quadratic equations and two unknowns, whose algebraic solution yields Harel's (1988) upper bound to the Erlang loss probability. We then derive a sequence of progressively stronger systems of equations, which eventually become exact. We provide two example applications.