消息机制的多信道公平调度算法  

A Fair Queueing Scheduling Algorithm for Multi-Channel Based on Signal

作　　者：王斌[1] 陈斌[1] 张小东[2] 丁炜[1] 

机构地区：[1]北京邮电大学通信网络综合技术研究所,北京100876 [2]中国科学院上海微系统与信息技术研究所,上海200050

出　　处：《北京邮电大学学报》2006年第2期70-73,共4页Journal of Beijing University of Posts and Telecommunications

摘　　要：提出了一种基于消息的多信道调度算法(SD-PRPS),该算法能将数据流均匀地分发给多个并行信道,对网络阻塞有很好的抑制能力.同时,它在公平性和延迟性能方面与基于分组通用处理机共享和基于分组的速率比率调度等算法有相似的性能,在保证每流带宽的基础上,能确保数据流的最大延时和最小缓冲区需求.A SD-PRPS （distributed packet by packet rate proportional server for K channels based on signal） scheduling algorithm was proposed. It could load the input flow over the multiple channels averagely. It was proved that the scheme can provide end to end delay to conformant traffic as packetbased generalized processor sharing（PGPS） and PRPS. The performance of SD-PRPS was studied using simulations and compared to worst-case fair weighted fair queueing （WF2Q）. The simulations show that the delay performance of SD-PRPS is better than WFZQ with decreasing flow rate.

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

分 类 号：TN393.0[电子电信—物理电子学]