Priority scheduling algorithm for ATM wireless network access

This paper discusses medium access issues for wireless asynchronous transfer mode (ATM) networks. In particular, a priority scheduling algorithm for a centralized access scheme has been analyzed using the Markov chain theory and the OPNET simulation package. The scheduler allocates resources to the terminals according to their priority class. Different algorithms (first-come first-serve, round robin, select largest queue) are proposed for scheduling the ATM traffic within the same priority class. The performance measures are cell delay, queue length, and cell loss ratio (CLR). It turns out that the scheduler algorithm strongly influences the cell delay which is most important for delay sensitive services. The CLR due to buffer overflows can be kept very low in general except for very bursty sources.