首页> 外文会议>International Conference on Communications, Circuits and Systems vol.1: Communication Theory and Systems; 20050527-30; Hong Kong(CN) >Packet Scheduling Algorithm Considering Both the Delay Constraint and User Throughput in HSDPA
【24h】

Packet Scheduling Algorithm Considering Both the Delay Constraint and User Throughput in HSDPA

机译:HSDPA中同时考虑延迟约束和用户吞吐量的分组调度算法

获取原文
获取原文并翻译 | 示例

摘要

This paper proposes a novel packet scheduling algorithm for delay constraint traffic on High Speed Down Link Packet Access(HSDPA) and also a packet scheduler for this algorithm. In this packet scheduling algorithm, we consider both the delay constraint and the throughput for each traffic class while maximizing the system capacity. Considering the delay constraint and the throughput simultaneously, our method can guarantee different quality of service (QoS) for each traffic class. Finally, in order to demonstrate the performance of our proposed algorithm, we compare our algorithm with Proportional Fairness (PF) method and Round Robin(RR) method by system simulations. Numerical results show that system performance can be significantly improved employing our algorithm than that with PF or RR method.
机译:本文提出了一种用于高速下行链路分组接入(HSDPA)上的延迟约束流量的新型分组调度算法,以及该算法的分组调度器。在此数据包调度算法中,我们在最大化系统容量的同时考虑了每个流量类别的延迟约束和吞吐量。同时考虑延迟约束和吞吐量,我们的方法可以为每种流量类别保证不同的服务质量(QoS)。最后,为了证明我们提出的算法的性能,我们通过系统仿真将我们的算法与比例公平(PF)方法和Round Robin(RR)方法进行了比较。数值结果表明,与PF或RR方法相比,使用我们的算法可以显着提高系统性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号