首页> 外文会议>IEEE InfoCOM >MEDF - A Simple Scheduling Algorithm for Two Real-Time Transport Service Classes with Application in the UTRAN
【24h】

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

机译:Medf - 一种简单的调度算法,可在UTRAN中使用应用程序的两个实时传输服务类

获取原文

摘要

In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-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 (EDF) algorithm for that task. In contrast to EDF, the MEDF is easy to implement in hardware and in contrast to algorithms like Weighted Fair Queuing (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.
机译:在本文中,我们考虑了UMTS地面无线电接入网络(UTRAN)中的实时语音流量,实时电路交换数据(CSD)和非实时分组交换数据(PSD)。焦点是在单个低带宽链路上互连无线电网络控制器(RNC)和基站(节点B)。我们表明此链接上的所有流量都具有实时要求。但我们利用无线电链路控制(RLC)层协议,并制定合适的服务质量(QoS)标准,导致两种不同的传输服务类(TSC):用于语音流量和CSD的严格TSC,以及容忍TSC PSD。 RNC通过向节点B的单个低带宽链路发送来自两个TSC的分组。由于该接口上的传输容量是UTRAN中的严重成本因数,因此应在尊重TSC的QoS要求的同时优化链路利用。我们为该任务提出了最早的截止日期(EDF)算法的修改版(Medf)。与EDF相比,MEDF易于在硬件中实现,与加权公平排队(WFQ)相反,由于MEDF调度程序中的合适参数设置不需要对流量组合的知识。仿真结果表明其优于先进先出(FIFO),静态优先(SP)和加权循环(WRR)调度。对等待时间分布的分析解释了为什么MEDF比其他调度策略更好地执行。

著录项

  • 来源
    《IEEE InfoCOM 》|2003年||共7页
  • 会议地点
  • 作者

    IEEE;

  • 作者单位
  • 会议组织
  • 原文格式 PDF
  • 正文语种
  • 中图分类 TB907.2-53;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号