一种具有小尺度公平的无线分组调度算法  

Wireless Packet Scheduling Algorithm with Small-scale Fairness

作　　者：李婧卿[1] 张春业[1] 万伟[1] 李仁波[1] 

机构地区：[1]山东大学信息科学与工程学院,山东济南250100

出　　处：《电气电子教学学报》2010年第4期45-48,共4页Journal of Electrical and Electronic Education

摘　　要：本文在调度判决时考虑到用户的访问时延限制,比例公平调度算法基础上提出了M-PF算法。本文建立了无线分组调度系统模型,通过仿真对新算法在小尺度服务时间保证、大尺度服务时间公平和系统吞吐量等方面的性能进行分析,研究了系统参数对算法性能的影响。结果证明,新算法在保证系统吞吐量和大尺度公平性的同时可以提供更好的小尺度服务时间保证。Considering the limit of user＇s access delay while making verdict, a scheduling algorithm named M-PF based on proportion fair scheduling algorithm is proposed. A wireless packet scheduling system model is established. Through simulation properties of the new algorithm in small-scale service time guarantee, large-scale service time fairness and system throughput are analyzed, and study of systematic parameters affecting properties of this algorithm is completed. Results show that the new algorithm can provide better service to the small-scale time as well as good performance in system throughput and large-scale fairness.

关 键 词：分组调度 无线通信 比例公平 访问时延 

分 类 号：TN929.5[电子电信—通信与信息系统]