Providing multiple service classes for bursty data traffic in cellular networks

This paper evaluates the use of packet scheduling to provide multiple service classes for bursty data traffic. In particular, we study the performance of the weighted fair queueing algorithm by simulating various scenarios in a packet cellular wireless network similar to an EDGE (Enhanced data rate for GSM evolution) system. The results show that, due to the burstiness of data traffic, traditional work-conserving packet scheduling algorithms such as weighted fair queueing cannot achieve the desired performance unless the system is heavily loaded. Similar results hold even when using priority queueing, which is an extreme form of weighted fair queueing. We also find that best effort traffic should be managed carefully to avoid inefficient usage of the network, especially in a low capacity cellular environment.