An analysis of bandwidth allocation strategies in multiservice networks

In this paper we consider calculating blocking probabilities for several bandwidth allocation policies in a multi rate multi class networks. A request can require multiple units of each resource (the multi-rate case) and it does not have to be the same for different requests of the same traffic type. We consider the standard complete-sharing policy, guaranteed-minimum sharing policies and a preemptive policy in a prioritized multi class system. The goal of this paper is to determine the probability of a new customer being admitted with a desired grade of service. We present approximate analytical tools to obtain blocking probabilities in a multi rate multi class system, where users of the same class can have different resource requirements. To validate our approach, we also develop a simulation of the system.