Queueing Analysis of a Threshold Based Priority Scheme For ATM Networks

In this paper, we propose a threshold based priority scheme in which a tuning parameter is used to provide adequate quality of service to real-time traffic while providing the best possible service to the nonreal time traffic. Our priority scheme is a generalization of the static priority scheme and the 1-limited scheme and is more flexible than both. For this scheme, we carry out a queueing analysis and obtain the joint distribution of the queue-lengths. We show by numerical examples how the parameter of this scheme can be tuned dynamically, so that the tuning function can be integrated with the call admission policy.