CDMA2000 1xEV-DO中的分组调度算法

移动通信系统需要更好地支持分组数据业务，并满足高速分组数据业务的服务质置要求。这可以通过采用好的调度算法提高平均业务速率和系统整体稳定性实现。针对CDMA2000 1x EV-DO系统的有代表性的调度算法有3种：正比公平算法、速率受限的最大载干比算法、加权公平排队-正比公平（WFQ-PF）联合算法。正比公平调度算法是一种算法简单实用的调度方案，但不能满足用户的服务质景保证；速率受限的最大载干比算法具有比正比公平算法更高的平均吞吐量，可方便地在吞吐量和公平性之间获得很好的折衷；WFQ-PF联合算法具有良好的综合性能，但算法较复杂。

Packet Scheduling Algorithms for CDMA20001x EV-DO System

Mobile communications systems are required to support packet data services and guarantee the QoS of high-speed packet data services. This could be realized by adopting good scheduling algorithms to improve the average service rate and the whole stability of the system. There are three typical scheduling algorithms for CDMA2000 1x EV-DO system: the proportional fairness scheduling algorithm, rate limited max C/I algorithm and Weighted Fair Queuing-Proportional Fair (WFQ-PF) algorithm. The proportional fairness scheduling algorithm is a simple and utility algorithm, but cannot guarantee the QoS for customers. The rate limited max C/I algorithm supports a higher average throughput than the proportional fairness algorithm. Therefore, using it, the compromise between throughput and fairness can be easily obtained. The WFQ-PF algorithm has a good general performance, but is too complex.