| 一种用于前向分组数据业务的新调度算法 |
| |
| 引用本文： | 王亚峰,杨大成.一种用于前向分组数据业务的新调度算法[J].电子与信息学报,2003,25(12):1669-1675. |
| |
| 作者姓名： | 王亚峰 杨大成 |
| |
| 作者单位： | 北京邮电大学无线通信中心,北京,100876 |
| |
| 基金项目： | 国家重点基础研究发展规划项目计划(973计划)资助课题 |
| |
| 摘 要： | 该文通过分析前向分组数据业务中应用的各种调度算法的性能,指出调度算法的吞吐量和公平性之间必然存在着折衷关系.在满足给定的公平性要求的情况下,吞吐量累积分布函数曲线越靠近公平性准则,吞吐量越高.基于这个认识,该文提出一种新的调度算法,它可以通过调节参数来改变吞吐量和公平性曲线的关系.而且,从吞吐量和公平性曲线折衷的角度出发,可以比较容易地找出一种近似最优解.
|
| 关 键 词： | 调度算法 正比公平 轮循算法 最大C/I算法 |
| 文章编号： | 1009-5896(2003)12-1669-07 |
| 收稿时间： | 2002-5-24 |
| 修稿时间： | 2002年5月24日 |
A Novel Scheduling Algorithm for Forward Link Packet Data Service |
| |
| Wang Ya-feng,Yang Da-cheng.A Novel Scheduling Algorithm for Forward Link Packet Data Service[J].Journal of Electronics & Information Technology,2003,25(12):1669-1675. |
| |
| Authors: | Wang Ya-feng Yang Da-cheng |
| |
| Affiliation: | Wireless Comm. Res. Center, Beijing Univ. of Posts and Telecomm., Beijing 100876; China |
| |
| Abstract: | 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. |
| |
| Keywords: | Scheduling algorithm Proportional fairness Round robin Maximum C/I algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子与信息学报》浏览原始摘要信息 |
|
点击此处可从《电子与信息学报》下载全文 |
|
