基于HSDPA的信道相关分组调度算法研究

Research on a HSDPA-based channel-related packet scheduling algorithm

针对HSDPA(高速下行分组接入)系统中几种支持非实时业务的经典分组调度算法Max C/I(最大载干比)和PF(正比公平)算法缺乏系统公平性的问题,提出一种基于HSDPA的快速公平分组调度算法。此算法在保证信道瞬时条件和系统吞吐量的前提下,旨在为那些平均吞吐量低于某一阈值的用户提供优先被服务的机会。仿真结果表明,此算法较之Max C/I和PF算法能够保证用户间的长期公平性。

This paper analyzes and studies two classical packet scheduling algorithms,Max C/I and PF,which support non-real time services in the High Speed Downlink Packet Access（HSDPA） system.In view of the lack of system fairness in these algorithms,this paper proposes a HSDPA-based fast fairness packet scheduling algorithm.While ensuring both the instantaneous channel condition and average system throughput,this algorithm provides the users,whose average throughput is below a certain threshold,with opportunities for priority in service.Simulation results show that this algorithm can ensure long-term fairness among the users.