首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于流的队列管理和队列调度的研究
引用本文:时培昕,雷振明.基于流的队列管理和队列调度的研究[J].重庆邮电学院学报(自然科学版),2004,16(1):27-33.
作者姓名:时培昕  雷振明
作者单位:北京邮电大学宽带技术研究中心,北京邮电大学宽带技术研究中心 北京100876,北京100876
摘    要:队列调度和队列管理是集成业务中报文处理的2个关键过程,但是现有的研究主要集中在队列调度的性能提高上,对集成业务中队列管理的研究很少。从报文处理整体性能分析出发,在SPFQ调度机制分析的基础上,提出了一种适合SPFQ调度的队列管理机制PRED。通过仿真分析,我们发现这样一种队列管理一队列调度的组合PRED-SPFQ能够在很大程度上提高整个报文处理过程的公平性和稳定性。

关 键 词:队列调度  队列管理  公平性

Consideration for per-flow queuing and scheduling algorithms
SHI Pei-xin,LEI Zhen-ming.Consideration for per-flow queuing and scheduling algorithms[J].Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition),2004,16(1):27-33.
Authors:SHI Pei-xin  LEI Zhen-ming
Abstract:Queue scheduling and queue management are the most important functional parts in packet processing under integrated service, but much work has been paid to the performance improvement for scheduling recently while few has been done on per-flow queue management. In this paper, we take the packet processing as a whole, and develop an effective per-flow queue management scheme PRED (potential-based RED) based on the implementation of SPFQ(starting potential-based fair queueing). Through rigid simulations, we find such a combination of PRED-SPFQ exhibits much better performance in fairness and stability for the whole packet processing than other combinations.
Keywords:queue scheduling  queue management  fairness
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号