一种基于多信道和分组的公平调度算法  

A Scheduling Algorithm for Fair Queueing Based on Multi-Channel

作　　者：王斌[1] 丁炜[1] 

机构地区：[1]北京邮电大学宽带通信网实验室,北京100876

出　　处：《北京邮电大学学报》2005年第2期12-15,90,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：教育部博士学科点专项科研基金(20020013011);华为科技基金项目"T比特路由器交换结构及调度算法研究"

摘　　要：提出了一种应用于多信道系统的公平调度算法,该方法能将数据流均匀地分发给多个并行信道,对网络阻塞有很好的抑制能力.同时它在公平性和延时性能方面与PGPS(packetgeneralizeprocessor)、PRPS(packetbypacketrateproportionalserver)等调度算法有相似的性能,在保证每流带宽的基础之上,能确保数据流的最大延时和最小缓冲区需求.A novel packet-scheduling algorithm for multi-channel is proposed in this paper, which can balance the input flow over the multiple channels. It can achieve the same quality with PGPS and PRPS on delay and equality. The scheme can guarantee bandwidth for a data flow, upper the delay bound and minimal the required buffer size.

关 键 词：K—PRPS调度算法 延时上限 网络计算理论 

分 类 号：TN915.04[电子电信—通信与信息系统]