By Topic

MEDF - a simple scheduling algorithm for two real-time transport service classes with application in the UTRAN

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Menth, M. ; Inst. of Comput. Sci., Wurzburg Univ., Germany ; Schmid, M. ; Heiss, H. ; Reim, T.

In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and nonreal-time packet-switched data (PSD) in the UMTS terrestrial radio access network (UTRAN). The focus is on the single low-bandwidth link that interconnects the radio network controller (RNC) and the base station (node B). We show that all traffic on this link has real-time requirements. But we take advantage of the radio link control (RLC) layer protocol and formulate suitable quality of service (QoS) criteria that lead to two different transport service classes (TSC): A stringent TSC for speech traffic and CSD, and a tolerant TSC for PSD. The RNC transmits packets from both TSCs via a single low-bandwidth link to the node B. Since transmission capacity on this interface is a serious cost factor in the UTRAN, the link utilization should be optimized while respecting the QoS requirements of both TSCs. We propose a modified version (MEDF) of the earliest deadline first (EOF) algorithm for that task. In contrast to EDF, the MEDF is easy to implement in hardware and in contrast to algorithms like weighted fair queueing (WFQ), the knowledge of the traffic mix is not needed for a suitable parameter setting in the MEDF scheduler. The simulation results show its superiority over first-in-first-out (FIFO), static priority (SP), and weighted round robin (WRR) scheduling. The analysis of the waiting time distribution explains why MEDF performs better than the other scheduling strategies.

Published in:

INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies  (Volume:2 )

Date of Conference:

March 30 2003-April 3 2003