期刊文献+

DiffeServ机制中队列调度算法的研究

Study on Queue Dispatching Algorithm in DiffeServ Mechanism
下载PDF
导出
摘要 主要阐述了一种基于区分服务机制的队列调度算法及其性能。对加权公平队列算法进行了分析和改进,通过算法仿真研究了改进算法W FQBP在区分服务机制中的优越性能,最后通过与其他常用队列调度算法的比较进一步阐明算法的特点,证实了改进算法W FQBP具有良好的适应性和可控性,并对该算法的应用和发展做出了分析。 This paper expounds a kind of scheduling algorithm based on Diffserv model and its performance. Weighted fair queuing algorithm mainly is analyzed and improved in this paper, and by algorithm simulation the advanced performance of improved Weighted Fair Queuing Based on Priority (WFQBP) is researched in Diffeserv mechanism. The characteristics of WFQBP in Diffserv mode are described by comparing with other popular queue dispatching algorithms, which proves that WFQBP is more adaptable and controllable. The algorithm's application and development is also explained in this paper.
出处 《电脑开发与应用》 2006年第12期39-41,共3页 Computer Development & Applications
关键词 加权公平队列(WFQ) 优先级 WFQBP 适应性 可控性 Weighted Fair Queuing(WFO), priority, WFQBP, adaptability, controllability
  • 相关文献

参考文献6

  • 1JosC R Gallardo,Dimitrios Makrakis.Dynamic Predictive Weighted Fair Queueing for Differentiated Services.IEEE computer,2001:1320-1323.
  • 2Jordan Lu,Rob Robotham.ON THE IMPLEMENTATION OF WEIGHTED FAIR QUEUING,IN HIGH SPEED NETWORKS.In:CCECE 2004-CCGEI 2004,2004:985-988.
  • 3Chin-Ling Chen.DiffServ Operational Model.In:Proceedings of the 27th Annual IEEE Conference on Local Computer Networks,2002:1033-1036.
  • 4Chul Kim,Youngtak Kim,Doug Montgomery.Fairness-guaranteed per-Class-type Queueing and Hierarchical Packet Scheduling for DiffServ-aware-MPLS Network.In:IEEE Communications Society 2004:1718-1722.
  • 5左利云.基于Diffserv模型的队列调度加权优化算法[J].茂名学院学报,2005,15(4):64-68. 被引量:1
  • 6尹红霞,王智,孙优贤.一种基于弱实时的加权公平队列调度算法[J].浙江大学学报(工学版),2005,39(10):1490-1495. 被引量:1

二级参考文献15

  • 1HAMDAOUI M., RAMANATHAN P. A dynamic priority assignment technique for streams with (m,k) firm deadlines [J].IEEE Transactions on Computers.1995, 44: 1443-1451.
  • 2PAREKH A, GALLAGER R. A generalized processor sharing approach to flow control: The single node case [J].IEEE Transactions on Networking, 1993, 1: 344-357.
  • 3GOLESTANI S. A self-clocked fair queuing scheme for broadband applications [A].Proceedings of the 13th Annual Joint Conference of the IEEE Computer and Communications Societies [C]. Toronto: IEEE Computer Society, 1994: 636-646.
  • 4GOVAL P, VIN H, CHENG H. Start time fair queuing: A scheduling algorithm for integrated services packet switching networks [J].IEEE Transaction on Networking, 1997, 5:690-704.
  • 5WANG S, WANG Y, Lin K. Integrating priority with share in the priority based weighted fair queuing scheduler for real time networks [J].Real Time Systems, 2002, 22: 119-149.
  • 6BENNETT J, ZHANG H. WF^2Q: worst case fair weighted fair queuing[A].Proceedings of the 15th Annual Joint Conference of the IEEE Computer and Communications Societies [C]. San Francisco, CA: IEEE Computer Society, 1996: 120-128.
  • 7BOUDEC J, THIRAN P. Application of network calculus to guaranteed service networks [J].IEEE Transactions on Information Theory,1998, 44: 1087 -1096.
  • 8IETF RFC 1633,Integrated Services in the Internet Architecture[S].
  • 9IETF RFC 2475,An Architecture for Differentiated Services[S].
  • 10刘伟 左天祖.IT基础架构中的服务级别管理[J].中国计算机用户,2003,(2):20-22.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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