Scheduling Algorithms for HS-DSCH in a WCDMA Mixed Traffic Scenario
暂无分享,去创建一个
Ahrtrncr - Scvelrl scheduling algorithms are evaluated far the HS-DSCH channel in B WCDMA mired traffic Scenario. The tr;if?ir consists of FTP and web surfing USCIS. The maximum channel quality indicator (CQI) schcme serves users with the highest channel quality. The proportional fairness (PF) scheme tends to be Fairer by prioritising users with higher channel quality (lower throughput). The weighted-queue-PF prioritises t~sers \,ith higher channel quality, lower throughput and those mith longer queued-time. The results depict that the maximum s!stem throughput is achieved by mas CQl scheduling, which is parely channel dependent. The mar CQl schemc is also rcbtivelp fail- to the FTP users. In ease ofweb surfing users, the proportionally fair scheduling is as good as the other schemes fur the 10% worst USCI'S.
[1] Frank Kelly,et al. Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..