Admission controls for Erlang's loss system with service times distributed as a finite sum of exponential random variables (Q1281340)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Admission controls for Erlang's loss system with service times distributed as a finite sum of exponential random variables |
scientific article; zbMATH DE number 1267364
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Admission controls for Erlang's loss system with service times distributed as a finite sum of exponential random variables |
scientific article; zbMATH DE number 1267364 |
Statements
Admission controls for Erlang's loss system with service times distributed as a finite sum of exponential random variables (English)
0 references
22 March 1999
0 references
Summary: 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.
0 references
single link loss network
0 references
threshold policy
0 references
robustness
0 references
0.90409756
0 references
0.86406535
0 references
0.8625462
0 references
0.8599346
0 references
0.85929775
0 references
0 references
0.8570717
0 references
0.85265845
0 references
