| Article ID: | iaor19992882 |
| Country: | New Zealand |
| Volume: | 2 |
| Issue: | 2 |
| Start Page Number: | 119 |
| End Page Number: | 132 |
| Publication Date: | Jul 1998 |
| Journal: | Journal of Applied Mathematics & Decision Sciences |
| Authors: | Ziedins Ilze, Moretta Brian |
| Keywords: | queueing networks |
It is known that a threshold policy (or trunk reservation policy) is optimal for Erlang's loss system under certain assumptions. In this paper we examine the robustness of this policy under 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.