Optimality of admission control in an M∕M∕1∕N queue with varying services

Abstract

Motivated by communication networks, we study a single-server queue with varying service rates and multiple customers’ types. The difference between types of customers is defined by the profits contributed to the system. We show that the optimal trunk reservation policy exists and we compare the optimal control levels with different parameter values. Furthermore, when the optimal trunk reservation policy is more than one, we prove the uniqueness of the bias optimal policy.