期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于弹性定额值的分组轮询调度算法 被引量：4

RQRR:A New Fair and Efficient Packet Scheduling Algorithm
在线阅读 下载PDF
导出
摘要 提出了一种新的适用于变长分组的调度算法——弹性定额值轮询调度算法(Resilient Quantum Round Robin,RQRR),与现有算法不同,该算法中每个数据流的定额值不是固定不变的,定额值的生成依赖于前一个轮次中各个数据流的发送情况。理论分析表明,RQRR可以保证数据流之间具有较好的公平性,它的公平性度量具有上界值7Max-1,其中Max为分组的最大长度。RQRR对每个分组的处理复杂度为O(1),易于实现、适用于高速网络。 Aiming at variable length packet queues,a new packet scheduling algorithm named Resilient Quantum Round Robin（RQRR）was presented. Different from existent algorithms, the quantum given to each of the flows in a round is not fixed and is calculated depending on the transmission situation of all the flows in the previous round. The theoretical analyses show that the relative fairness measure of RQRR has an upper bound of 7Max--1, where Max is the largest size of the packets. RQRR takes 0（1）processing complexity per packet and is simple to implement at high-speed net- works.
作者 刘桂开 高蕾
机构地区 湖南科技大学计算机科学与工程学院
出处 《计算机科学》 CSCD 北大核心 2013年第8期72-78,共7页 Computer Science
基金 湖南省科技厅科技计划项目(2010GK3045) 湖南省教育厅科研项目(10C0687)资助
关键词 分组调度 轮询 弹性定额值 公平性 实现复杂度 Packet scheduling Round robin Resilient quantum Fairness Implementation complexity
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献17

  • 1Demers A, Keshav S, Shenker S. Analysis and simulation of a fair queueing algorithm[J]. Proc. SIGCOMM '89,1989,19 (4) : 1-12.
  • 2Keshav S. On the efficient implementation of fair queuing[J]. Journal of Internetworking Research and Experience, 1991, 2 (3) ： 1-20.
  • 3Bennett J C R, Zhang H. WF2Q： Worst-ease fair weighted fair queueing[C]// INFOCOM ' 96. San Fran-ciso, California, Mar. 1996:120-128.
  • 4Zhang L. Virtual eloek:A new traffic control algorithm for pack- et switching networks[C]//Proceedings of ACM SICW_MM. Philadelphia, September 1990 ： 19-29.
  • 5Golestani S. A self-clocked fair queueing scheme for broadband applieations[C]//INFOCOM'94. June 1994:636-646.
  • 6Parekh A. A generalized processor sharing approach to flow con- trol in integrated services network[D3. Dept. Elect. Eng. and Comput. Sci. ,M. I. T. ,Feb. 1992.
  • 7Shreedhar M,Varghese G. Efficient Fair Queuing Using Deficit Round Robin [J ]. IEEE/ACM Transaction on Networking ($1063-6692), 1996,4(3) : 375-385.
  • 8Sivakumar G, Ramprasad A V. Analysis of FiWi networks to improve TCP Performance[C] // 2012 International Conference on Computing, Communication and Applications (ICCCA). 2012:1-6.
  • 9Ayaz S, Hoffmann F, German R, et al. Analysis of deficit round robin scheduling for future aeronautical data link[C]//2011 IEEE 22nd International Symposium on Personal Indoor and Mobile Radio Communieations(PIMRC). 2011:1809-1814.
  • 10Sleem M Y, E1Badawy H M, Abo-E1-Seoud M S. Two layer channel aware scheduling for QoS support in IEEE 802. 16/ WiMAX networks[C]//2011 Eighth International Conference on Wireless and Optical Communications Networks (WOCN). 2011 : 1-5.

二级参考文献32

  • 1Shreedhar M, Varghese G. Efficient Fair Queueing Using Deficit Round-Robin. IEEE Trans on Networking, 1996, 4 (3) : 375 - 385.
  • 2Lenzini L, Mingozzi E, Stea G. Full Exploitation of the Deficit Round-Robin Capabilities by Efficient Implementation and Parameter Tuning. Univ of Pisa Italy Tech Rep, 2003.
  • 3Cruz R L. A Calculus for Network Delay, Part I: Network Elements in Isolation. IEEE Trans on Information Theory, 1991,37 (1): 114-131.
  • 4Cruz R L. A Calculus for Network Delay, Part 1I: Network Analysis. IEEE Transactions on Information Theory, 1991,37( 1 ) : 132 - 141.
  • 5Bechler M, Ritter H, Schafer G, et al. Traffic Shaping in end Systems Attached to Qos-Supporting Networks. 1EEE Computer Society: IEEE Symposium on Computers and Communications. Washington : IEEE Computer Society, 2001, 296 - 301.
  • 6Urvoy G, DaUery Y, Hebuteme G. CAC Procedure for Leaky Bucket-Constrained Sources. Computer Networks, 2004, 44 (4) : 463 - 479.
  • 7Leon-Garcia A, Widjaja I. Communication Networks: Fundamental Concepts and Key Architectures. Columbus: McGraw-Hill Companies Inc, 1999, 518 - 527.
  • 8Parekh A K, Gallager R G. A generalized processor sharing approach to flow control in integrated services networks: The single node case. IEEE/ACM Trans. on Networking, 1993, 1(3):344 - 357.
  • 9Shreedhar M, Varghese G. Efficient fair queueing using deficit round robin. IEEE/ACM Trans. on Networking, 1996, 4(3): 375- 385.
  • 10Macgregor M, Shi W. Deficit for bursty latency-critical flows:DRR++, IEEE International Conference on Networks, Singapore,2000:287 - 293.

共引文献1

同被引文献23

  • 1陈华根,吴健生,王家林,陈冰.模拟退火算法机理研究[J].同济大学学报（自然科学版）,2004,32(6):802-805. 被引量：148
  • 2林贞,李正权.一种多源协作网络中轮询节点选择算法[J].中国计量学院学报,2013,24(3):284-289. 被引量：3
  • 3杨善林,李永森,胡笑旋,潘若愚.K-MEANS算法中的K值优化问题研究[J].系统工程理论与实践,2006,26(2):97-101. 被引量：197
  • 4C Steiger, H Walder, M Platzner. Operating Systems for Reconfig-urable Embedded Platforms : Online Scheduling of Real-time Tasks[J ] . IEEE Transactions on Computers, 2014 , 53 ( 11 ) : 1393 -1407.
  • 5Abhilash, R Chakka, Challa R K. Numerical Performance Evalua-tion of Heterogeneous Multi - server Models with Breakdowns andFCFS,LCFS-PR, LCFS-NPR Repair Strategies[ C]. In; 20131EEE 3rd International Advance Computing Conference ( IACC ),Ghaziabad U.S.A.,Feb. 2013:566-570.
  • 6Jia Ru, J Keung. An Empirical Investigation on the Simulation ofPriority and Shortest-Job - Firet Scheduling for Cloud - Based Soft-ware Systems[ C]. In: 2013 22nd Australian Software EngineeringConference ( ASWEC) , Melbourne Australia, Jun. 2013:78-87.
  • 7J J Kizhakkethottam, S Karthik, S S V Chandra. Novel Fair ShareFlow Scheduling Algorithm for ATM Network [ C ]. In :2013 IEEEPacific Rim Conference on Communications, Computers, and Sig-nal Processing (PACRIM) , Victoria, BC,Aug. 2013:217-222.
  • 8N Nasser, L Karim, T Taleb. Dynamic Multilevel Priority PacketScheduling Scheme for Wireless Sensor Network[ J]. IEEE Trans-actions on Wireless Communications, 2013 ,12(4) :1148-1459.
  • 9R J Matameh. Self-Adjustment Time Quantum in Round RobinAlgorithm Depending on Burst Time of the Now Running Processes[J]. American Journal of Applied Sciences,2014,6(10) : IS31-IS37.
  • 10白素媛,修俊玲.用计算机进行曲线拟合和回归分析[J].辽宁师范大学学报（自然科学版）,2000,23(1):44-46. 被引量：4

引证文献4

二级引证文献12

计算机科学
2013年 第8期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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