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

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

作　　者：刘晏兵[1] 孙世新[1] 刘蕾[2] 

机构地区：[1]电子科技大学计算机学院,成都610054 [2]重庆邮电学院,重庆400065

出　　处：《计算机工程》2006年第1期119-120,162,共3页Computer Engineering

基　　金：国家外专局和国家自然科学基金联合资助项目(RJ2002510201);重庆市科委应用基础项目(2005BB2060);重庆市教委项目(KJ050507)

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

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

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