作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2006, Vol. 32 ›› Issue (1): 119-120,162.

• 网络与通信 • 上一篇    下一篇

基于堆排序的 PQ+CBWFQ 路由器排队调度算法

刘晏兵1,2,孙世新1,刘蕾 2   

  1. 1.电子科技大学计算机学院,成都 610054;2. 重庆邮电学院,重庆 400065
  • 出版日期:2006-01-05 发布日期:2006-01-05

Queue Scheduling Algorithm of the PQ+CBWFQ in Router Based on Heap Sort

LIU Yanbing1, 2, SUN Shixin1, LIU Lei2   

  1. 1. School of Computer Science, UEST, Chengdu 610054;2. Chongqing University of Posts & Telecommunications, Chongqing 400065
  • Online:2006-01-05 Published:2006-01-05

摘要: 研究具有QoS 特征、易于实现的排队算法一直是优化带宽的重要手段,也是提高宽带IP 网络性能的主要途径。文章提出基于堆排序的PQ+CBWFQ 网络路由器排队调度算法进行具体实现,并给出低成本的硬件实现方案,对未来的高性能路由器设计具有重要的参考价值。

关键词: 路由器;堆排序;排队调度算法

Abstract: Working over the queuing algorithm with the character of QoS and easy realization is always a significant measure to optimize bandwidth, also is a main approach to enhance the performance of IP network. This paper offers a queue scheduling algorithm of the PQ+CBWFQ in router based on heap sort, algorithm realization and hardware plan of low-cost. It is of important significance to design high-performance router in future.

Key words: Router; Heap sort; Queue scheduling algorithm