Weighted round robin scheduling strategies in (E)GPRS radio interference

Abstract

Different types of data services have various requirements for delay and throughput. When a service mix containing both delay sensitive and insensitive types of services is offered over a shared channel, it is very beneficial to prioritize the resource usage of each service. An analytical model is presented for studying weighted round robin queuing in the (EDGE) general packet radio service radio interface. A quickly computable model allows a large number of service mixes to be studied. The model yields the gain achieved by prioritization in terms of maximum carried load with given end user satisfaction criteria. According to the model, it is shown that using weighted round robin scheduling brings a notable increase in the maximum carried load. However, tuning the queue weights, either based on statistical data on the average mix of different services or dynamically taking into account the current instantaneous active connections, does not increase the maximum carried load significantly.