On threshold based admission control in multi-service networks

This paper offers an approach to the calculation of approximate values of the thresholds for the threshold based admission control strategies in a multi-service network. We assume that multiple services compete for multiple network resources. Requests of different services have different resource requirements and generate different revenues. We assume that statistical characteristics of the request arrival processes and holding times are known. A number of approximations have been developed for a case of multiple services competing for a single resource. We discuss various approaches to the decomposition of a system with multiple services competing for multiple resources into a collection of systems with multiple services competing for a single resource.