A Novel Scheduling Algorithm for Forward Link Packet Data Service
一种用于前向分组数据业务的新调度算法

Forward link packet data service scheduling algorithm is extensively researched and it is indicated that there is an exclusive relationship between the data throughput and fairness. Under certain fairness criteria, the closer the data throughput cumulative distribution functions to the fairness criteria, the higher the data throughput. Based on this judgment, here a new scheduling algorithm is proposed, which can change the relationship between the data throughput and fairness criteria through adjusting the parameters. Furthermore, with a view on the tradeoff between the data throughput and fairness, the asymptotic optimal approximation can be found quite easily.