Abstract

It is known that a threshold policy (or trunk reservation policy) is optimal for Erlang's loss system under certain assumptions. This paper examines the robustness of this policy under departures from the standard assumption of Poisson arrivals and shows that the optimal policy has a generalized trunk reservation form.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call