期刊文献+

WFQ与WRR调度算法的性能分析与改进 被引量:13

Performance Analysis and Improvement About WFQ and WRR Schedule Algorithm
下载PDF
导出
摘要 不同类别的业务对时延及时延抖动的要求是不同的,为了满足不同业务的服务质量(QoS),选择一种合适的队列调度算法至关重要.研究了分组长度对WRR及WFQ算法公平性以及时延性能的影响,并提出了一种基于分组长度及队列权重的改进型WRR算法——enhanced-WRR.仿真结果表明,当分组长度相同时,WRR与WFQ的时延性能几乎一致;当分组长度不同时,WRR算法不能保证高优先级队列的时延要求,而E-WRR算法的时延性能逼近WFQ算法,能很好地保证高优先级队列的时延要求,并且极大降低了算法复杂度. Different multimedia services have different requirement of delay and jitter,it is essential to select an appropriate schedule algorithm to meet the quality of service(QoS)of different multimedia services.Firstly,the impact on performance of delay and fairness of WRR and WFQ algorithm was studied;then,an enhanced WRR(E-WRR)algorithm based on packet length and queue weight was proposed.Simulation results show that when the packet length in different queues are same,almost same delay performance can be approached by both WRR and WFQ;when the packet length in different queues are different,the delay requirement of higher priority queue cannot be approached with WRR algorithm.However,the delay performance of proposed E-WRR algorithm can be close in upon WFQ algorithm,which can guarantee the delay requirement of higher priority queue,and greatly reduce the calculation complexity of schedule algorithm.
出处 《北京理工大学学报》 EI CAS CSCD 北大核心 2015年第3期316-320,共5页 Transactions of Beijing Institute of Technology
关键词 分组长度 公平调度 复杂度 时延性能 packet length fairly schedule calculation complexity delay performance
  • 相关文献

参考文献8

二级参考文献21

  • 1BENNETT J C R, ZHANG H. Hierarchical Packet Fair Queuing Algorithms [J]. IEEE/ACM Transactions on Networking (S 1063-6692), 1997, 5(5): 675 -689.
  • 2SHREEDHAR M, VARGHESE G. Efficient Fair Queuing Using Deficit Round Robin [J]. IEEE/ACM Transaction on Networking (S1063-6692), 1996, 4(3): 375-385.
  • 3GUO C. SRR: An O (1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks [J]. Proceedings of the 2001 SIGCOMM Conference (SO 146-4833), 2001, 31(4): 211-222.
  • 4CAPRITA B, WONO C, NIEH J. Group Round Robin: Improving The Fairness and Complexity of Packet Scheduling [C]//Proc of the 1st ACM/ IEEE Symposium on Architectures for Networking and Communications Systems (ANCS 2005). Princeton, USA: ACM, 2005: 29-40.
  • 5SRIRAM R, JOSEPH E Stratified Round Robin: A Low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay [C]// ACM SIGCOMM'03. Karlsruhe, USA: ACM, 2003: 239-250.
  • 6Duan Z, Zhang Z L, Hou Y T. Fundamental Trade-offs in Aggregate Packet Scheduling [J]. IEEE Transactions on Parallel and Distributed Systems (S1045-9219), 2005, 16(12): 1166-1177.
  • 7QI W, DONG M, CHEN H, et al. The Performance of Scheduling Algorithms with a Prospect of Bandwidth Overprovisioning [C]// International Conference on Communication Technology. Beijing, China: IEEE, 2003: 429-436.
  • 8Zhang L,ACM Transactions on Computer Systems,1991年,9卷,1期,101页
  • 9Benett J,IEEE Infocom'96,120页
  • 10Benett J,IEEE Trans Networking,1997年,5卷,5期,675页

共引文献25

同被引文献88

引证文献13

二级引证文献39

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部