Optimal trunk reservation for an overloaded link

  • Authors:
  • John A. Morrison

  • Affiliations:
  • -

  • Venue:
  • Operations Research Letters
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider a single overloaded link with a large number of circuits which is offered two kinds of calls. The traffic intensity of the primary calls is assumed to be strictly less than 1, and R of the circuits are reserved for these. Rewards are generated when calls are accepted, and it is assumed that the reward for primary calls is greater than that for secondary calls. We determine the trunk reservation parameter R which asymptotically maximizes the long run average reward.