期刊文献+

PFWRR:能实现比例公平的增强型WRR 被引量:5

PFWRR:An Enhanced WRR Scheduling Realizing the Proportion Fairness Principle
下载PDF
导出
摘要 为了实现比例公平原则,在加权轮循调度(WRR)算法的基础上提出了比例公平WRR调度算法——PFWRR.PFWRR依据各队列的平均分组到达率,调整各队列的调度权值,从而在当队列长度小于等于缓冲长度时,保证各队列的平均分组排队时延符合给定比例;当队列长度大于缓冲时,保证各队列的平均分组丢失率符合给定比例.PFWRR的计算负荷是合理的,因为它仅当系统超载且平均分组到达率发生变化时,才调整各队列的服务率.实测性能显示:当系统超载且不出现分组丢失时,PFWRR实现了比例平均分组排队时延保证,当系统出现分组丢失时,PFWRR实现了比例平均分组丢失率保证. To realize proportion fairness principle, a scheduling based on Weighted Round Robin (WRR) is proposed, whose name is Proportion Fairness WRR(PFWRR). PFWRR adjusts each queuers weight in terms of the average packet arrival rate to guarantee that the proportion of average queuing delay accords with the differentiation parameters when each queuers length is smaller than or equals to its buffer length and the proportion of average packet loss rate accords with the differentiation parameters when the system begins to drop packets. The computation load of PFWRR is reasonable because it renews each queuers weight only when the system is overloaded and the average packet arrival rate changes. The experiment shows that PFWRR can realize the average queuing delay proportion fairness principle when the system is overloaded but do not drop packets and the average packet loss rate proportion fairness principle when packet loss happens in the system.
出处 《计算机学报》 EI CSCD 北大核心 2008年第5期775-782,共8页 Chinese Journal of Computers
基金 北京市教育委员会科技发展计划重点项目基金(KZ2005100005006) 国家自然科学基金(90407017,60403035) 国家“九七三”重点基础研究发展规划项目基金(2007CB307105,2007CB307100)资助~~
关键词 加权轮循调度 比例公平 平均分组排队时延 平均分组丢失率 平均分组到达率 weighted round robin proportion fairness the average packet queuing delay the average packet loss rate the average packet arrival rate
  • 相关文献

参考文献16

  • 1Braden R, Clark D, Shenker S. Integrated services in the internet architecture: An overview. RFC 1633, 1994.
  • 2Nichols K, Blake S, Baker F, Black D. Definition of the differentiated services field (DS field) in the IPv4 and IPv6 headers. RFC 2474, 1998.
  • 3Rosen E, Viswanathan A, Callon R. Multi-protocol label switching architecture. RFC 3031, 2001.
  • 4Constantinos Dovrolis, Dimitrios Stiliadis, Parameswaran Ramanathan. Proportional differentiated services: Delay differentiation and packet scheduling. IEEE/ACM Transactions on Networking, 2002, 10(1): 12-26.
  • 5Parekh A K, Gallager R G. A generalized processor sharing approach to flow control in integrated services networks: The single node-case. IEEE/ACM Transactions on Networking, 1993, 1(3): 344-357.
  • 6Bennett J C R, Zhang H. Hierarchical packet fair queuing algorithm. IEEE/ACM Transactions on Networking, 1997, 5(5): 675-689.
  • 7Golestani S. A self-clocked fair queuing scheme for broadband applications Proceedings of the IEEE INFOCOM'94. Toronto, 1994:6363-6466.
  • 8Shimonishi H, Yoshida M, Ruixue F et al. An improvement of weighted round robin eells seheduling in ATM networks Proeeedings of the IEEE Global Teleeommunieations Conference. Phoenix, AZ, 1997:1119-1123.
  • 9Shreedhar M, Varghese G. Efficient fair queuing using deficit round robin. IEEE/ACM Transactions on Networking, 1996, 4(3): 375-385.
  • 10陈洁,孙曙和,陈雪.APON业务调度算法的研究与实现[J].光通信研究,2002(6):5-9. 被引量:1

二级参考文献20

  • 1MischaSchwartz.宽带网络性能分析[M].北京:清华大学出版社,1998..
  • 2Martin De Prycker(著),程时端,刘斌(译).异步传递方式宽带ISDN技术 [M].北京:人民邮电出版社,1999.
  • 3Uyless Black.宽带网络技术基础 [M].北京:清华大学出版社,1998.
  • 4ITU-T Recommendation G 983-1998,High speed optical access systems based on passive optical network(PON) techniques[S].
  • 5ITU-T Draft Recommendation G.983-2000,A broadband optical access system with increased service capability using dynamic bandwidth assignment [S].
  • 6J.W. Causey, H. S. Kim. Comparison of buffer allocation schemes in ATM switched: Complete sharing, partial sharing and dedicated allocation. ICC 1994. New Orleans, LA, USA, 1994.
  • 7S. Floyd, V. Jacobson. Random early detection gateways for congestion control. IEEE/ACM Trans. Networking, 1993, 1(4): 397~413.
  • 8S. Athuraliya, D. Lapsley, S. H. Low. An enhanced random early marking algorithm for Internet flow control. IEEE INFOCOM'2000, Tel-Aviv, Israel, 2000.
  • 9D. Clark, W. Fang. Explicit allocation of best-effort packet delivery service. IEEE/ACM Trans. Networking, 1998, 6 (4):362 ~ 373.
  • 10C. Dovrolis, P. Ramanathan. Proportional differentiated services,part Ⅱ: Loss rate differentiation and packet dropping. IEEE/IFIP Int'l Workshop Quality of Service (IWQoS), Pittsburgh, PA,2000.

共引文献4

同被引文献43

  • 1孙祺,高振明,李骐.比例区分服务模型下的绝对时延保证[J].计算机应用,2004,24(9):70-73. 被引量:1
  • 2郑波,林闯,李寅.一种适用于网络处理器的队列管理算法[J].计算机研究与发展,2005,42(10):1698-1705. 被引量:5
  • 3李双庆,许峰.支持区分服务的自适应队列调度管理[J].计算机应用,2007,27(B06):170-171. 被引量:5
  • 4刘克非,王红,许作萍.一种基于服务质量预测的Web服务选择方法[J].计算机技术与发展,2007,17(8):103-105. 被引量:11
  • 5Chiu D,Jain R. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks[J]. Computer Networks and ISDN Systems, 1989,17 ( 1 ) : 1-14.
  • 6Floyd S. Connections with multiple congested routers in packetswitched networks, part 1 :one-way traffic[J]. Computer Communication Review, 1991,21 (5) : 30-47.
  • 7Wei D X,Jin C, Low S H, et al. FAST TCP: Motivation, architecture,algorithms, performance[J]. IEEE/ACM Transactions on Networking,2006,14(6):1246-1259.
  • 8Yuan C,Tan L S,Lachlan L H,et al. A generalized FAST TCP- scheme [J]. Computer Communications, 2008, 31 (14): 3242- 3249.
  • 9Ren F Y, Huang X M, Lin C. Design of a Two-category Classifier with Multi-dimension for Active Queue Management[C]//First ACM SIGCOMM Asia Workshop. Beijing, China, April 2005 : 150-157.
  • 10Fei A,Pei G,Liu R,et al. Measurements on delay and hop-count of the internet[C]//IEEE GLOBECOM ' 98--Internet Mini-con ferenee. Sydney. Australia, November 1998.

引证文献5

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部