摘要
主要讨论通用无线分组业务(GPRS)调度算法。首先介绍了一些常用分组调度算法,给出了GPRS中服务质量(QoS)定义和GPRS中选择分组调度算法原则,并根据对GPRS特性和三种算法性能的分析与比较,提出了一种新的基于延迟约束分组调度算法。通过仿真发现,新算法可在满足延迟要求基础上以较小复杂度获得比其余算法更高的资源利用率。
It is focused on scheduling algorithms for the general packet radio service (GPRS) in this paper. After introducing some packet scheduling algorithms used in many literatures,we give out the definition of quality of servive (QoS) and principles of selecting packet algorithms for GPRS first, then analyse three algorithms fitting for GPRS and present a new packet scheduling algorithm based on delay requirement. It has been proved by simulation that the new algorithm is able to meet the delay requirements at a much higher resource utilization with a little complexity compared to other alternatives such as FIFO,SPS and EDD.
出处
《通信学报》
EI
CSCD
北大核心
2002年第9期107-113,共7页
Journal on Communications
基金
国家自然科学基金资助项目(69873019)
吉林省自然科学基金资助项目(20000545)
