节点文献
基于Round Robin无线调度策略的公平性分析
Fairness Analysis and Comparison of Wireless Packet Scheduling Algorithm
【摘要】 在无线调度策略中,保证公平性和提高系统吞吐量是矛盾的,因为保证公平性是以牺牲系统吞吐量为代价的。本文首先给出基于Round Robin无线调度策略的时间公平性和容量公平性定义,然后研究在一定系统吞吐量下调度策略可以保证的最大时间公平性和容量公平性,并在理论上证明在相同吞吐量下时间公平性不小于容量公平性,仿真结果表明了理论分析的正确性。
【Abstract】 Fairness and throughput are contradictory in wireless packet scheduling algorithm, for guaranteeing fairness is at the cost of sacrificing system throughput. Temporary fairness and utilitarian fairness of wireless packet scheduler based on Round Robin were defined in this paper. Then the maximum guaranteed temporary fairness and utilitarian fairness were developed for a given system throughput. It’s proved theoretically that maximum temporary fairness is not less than utilitarian fairness for any given system throughput. Simulation result confirms the previous analysis.
【Key words】 Packet scheduling; round robin; fairness; throughput;
- 【文献出处】 信息工程大学学报 ,Journal of Information Engineering University , 编辑部邮箱 ,2005年03期
- 【分类号】TN92
- 【被引频次】5
- 【下载频次】115