Admission controls for Erlang's loss system with service times distributed as a finite sum of exponential random variables

摘要

It is known that a threshold policy (or trunk reservation policy) is optimal for Erlang’sloss system under certain assumptions. In this paper we examine the robustness of this policyunder departures from the standard assumption of exponential service times (call holding times)and give examples where the optimal policy has a generalized trunk reservation form.