Sciweavers

Share
INFOCOM
2003
IEEE

MEDF - A Simple Scheduling Algorithm for Two Real-Time Transport Service Classes with Application in the UTRAN

8 years 10 months ago
MEDF - A Simple Scheduling Algorithm for Two Real-Time Transport Service Classes with Application in the UTRAN
— In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-time packetswitched 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 (EDF) algorith...
Michael Menth, Matthias Schmid, Herbert Heiss, Tho
Added 04 Jul 2010
Updated 04 Jul 2010
Type Conference
Year 2003
Where INFOCOM
Authors Michael Menth, Matthias Schmid, Herbert Heiss, Thomas Reim
Comments (0)
books