一种适用于多业务场景的HSDPA分组调度算法  

A Novel Packet Scheduling Algorithm for Multi-service Scenarios on HSDPA

作　　者：李玉玲[1] 杜洪[2] 樊滨温[2] 

机构地区：[1]郑州航空工业管理学院计算机系,河南郑州450015 [2]哈尔滨工业大学深圳研究生学院,广东深圳518055

出　　处：《计算机与现代化》2011年第9期19-21,25,共4页Computer and Modernization

摘　　要：针对HSDPA多业务应用场景,提出一种新的分组调度算法。该分组调度算法在保证每种业务的QoS的同时,兼顾公平性和分组时延限制。在包含流类、交互类以及背景类业务的应用场景里对该算法进行仿真。仿真结果表明,与正比公平和M-LWDF算法相比,该算法能获得更好的系统性能。This paper proposes a new packet scheduling algorithm for multi-service scenarios on High Speed Downlink Packet Access（HSDPA）.This packet scheduling algorithm consideres both the delay constraint and the fairness for each traffic class while guaranteeing different quality of service（QoS） for each traffic class.The strategy is evaluated in a scenario including steaming and interactive and background traffic.Numerical simulation results show that system performance can be more significantly improves employing this algorithm than that with PF or M-LWDF method.

关 键 词：多业务 分组调度算法 正比公平算法 M-LWDF算法 公平性 分组时延 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]