• PERFORMANCE COMPARISON OF PRIORITY SCHEMES WITH PRIORITY JUMPS IN WIRELESS NETWORKS

Abstract

Network traffic can often be divided into multiple classes of traffic, each having a different QOS (Quality of Service) standard. For delay-sensitive traffic, it is important that mean delay and delay jitter are not too large, while for delay-insensitive traffic, the loss ratio is the restrictive quantity. To support and differentiate several classes of traffic in a network, priority schemes are used. In the priority scheduling discipline for instance, priority is always given to the delay sensitive traffic, i.e. high priority traffic is always scheduled for service before the delay-insensitive (low-priority) traffic. We consider three models and analyze a jumping scheme in which a random call of the low priority queue can jump to the high priority queue (to incorporate “impatient” calls). Some performance measures such as blocking probability of new calls and dropping probability of handoff calls is obtained.