Research Article
STEM+: A Fair and Efficient Algorithm for Scheduling on the DSCH of UMTS Networks
@INPROCEEDINGS{10.1109/CHINACOM.2007.4469565, author={R. M. Karthik and Joy Kuri}, title={STEM+: A Fair and Efficient Algorithm for Scheduling on the DSCH of UMTS Networks}, proceedings={2nd International ICST Conference on Communications and Networking in China}, publisher={IEEE}, proceedings_a={CHINACOM}, year={2008}, month={3}, keywords={3G mobile communication Aggregates Algorithm design and analysis Communication system traffic control Downlink Processor scheduling Rayleigh channels Scheduling algorithm Throughput Traffic control}, doi={10.1109/CHINACOM.2007.4469565} }- R. M. Karthik
Joy Kuri
Year: 2008
STEM+: A Fair and Efficient Algorithm for Scheduling on the DSCH of UMTS Networks
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2007.4469565
Abstract
In Universal Mobile Telecommunication Systems (UMTS), the Downlink Shared Channel (DSCH) can be used for providing streaming services. The traffic model for streaming services is different from the commonly used continuouslybacklogged model. Each connection specifies a required service rate over an interval of time, k, called the control horizon. In this paper, our objective is to determine how k DSCH frames should be shared among a set of I connections. We need a scheduler that is efficient and fair and introduce the notion of discrepancy to balance the conflicting requirements of aggregate throughput and fairness. Our motive is to schedule the mobiles in such a way that the schedule minimizes the discrepancy over the k frames. We propose an optimal and computationally efficient algorithm, called STEM+. The proof of the optimality of STEM+, when applied to the UMTS rate sets is the major contribution of this paper. We also show that STEM+ performs better in terms of both fairness and aggregate throughput compared to other scheduling algorithms. Thus, STEM+ achieves both fairness and efficiency and is therefore an appealing algorithm for scheduling streaming connections.