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

一种基于CICQ支持组播公平服务的调度策略 被引量：1

Multicast fair service scheduling algorithm for CICQ switches
在线阅读 下载PDF
导出
摘要 针对目前基于CICQ(combined input and crosspoint queuing)支持组播的调度策略在公平性和实时性能保障方面存在的不足,提出了一种简单、高效的支持组播公平服务的分层平滑轮询调度算法——mFGSR(multi-cast fair service and group smoothed round robin)。mFGSR依据组播业务流的权重进行分组和平滑调度,具有良好的可扩展性和公平性能,能够适应实时业务的性能需求。理论分析和仿真结果表明,该算法具有良好的时延、吞吐量和公平性能。 To overcome the deficiencies in supporting fair and QoS scheduling,this paper proposed a fair and simple high-performance multicast scheduling algorithm for combined input-crosspoint-queued switches,which was called mFGSR.mFGSR grouped and scheduled flows according to the weight of flows.It had good fairness and could adapt to the need of real-time performance.Theorotical analysis and simulation results show that the mFGSR exhibits good delay,throughput and fairness performance.
作者 王鹏 陈庶樵 扈红超
机构地区 国家数字交换系统工程技术研究中心
出处 《计算机应用研究》 CSCD 北大核心 2011年第10期3845-3848,共4页 Application Research of Computers
基金 国家"863"计划资助项目(2009AA01A346) 河南省基础与前沿技术研究计划资助项目(072300410010)
关键词 交换结构 调度策略 CICQ 组播 公平服务 平滑 switch architecture scheduling algorithm CICQ multicast fair service smooth
分类号 TP393 [自动化与计算机技术—计算机应用技术]
作者简介 作者简介：王鹏（1985-），男，河南周口人，博士研究生，主要研究方向为交换结构与调度算法、网络安全（wangpeng．ndsc@gmail．com）； 陈庶樵（1973-），男，教授，博士，主要研究方向为网络管控、网络安全； 扈红超（1983-），男，博士，主要研究方向为高性能交换结构与调度算法、网络管控．
  • 相关文献

参考文献13

  • 1GIACCONE P, LEONARDI E. Asymptotic performance limits of swit- ches with buffered crossbars supporting multicast traffic [ J ]. IEEE Trans on Information Theory,2008,54(2) :595-607.
  • 2MHAMDI L. On the integration of unicast and multicast cell schedu- ling in buffered crossbar switches [ J]. IEEE Zrans on Parallel and Distributed Systems,2009,20(6) :818-830.
  • 3PAREKH A. A generalized processor sharing approach to flow control in integrated services network [ D ]. Cambridge : MIT, 1992.
  • 4CAPRITA B,NIEH J,CHAN W C. Group round robin: improving the fairness and complexity of packet scheduling[ C ]//Proc of ACM Sym- posium on Architecture for Networking and Communications Systems. New York : ACM Press,2005:29-40.
  • 5RAMABHADRAN S, PASQUALE J. Stratified round robin: a low complexity packet scheduler with bandwidth fairness and bounded de- lay [ C ]//Proc of ACM SIGCOMM. New York : ACM Press,2003 : 239 - 250.
  • 6GUO Chuan-xiong. SRR : an O( 1 ) time complexity packet scheduler for flows in multi-service packet networks[ J]. IEEE ACM Trans on Networking,2004,12 (6) :1144-1155.
  • 7GUO Chuan-xiong. G-3 : an O ( 1 ) time complexity packet scheduler that provides bounded end-to-end delay [ C ]//Proc of IEEE INFO- COM. Washington DC : IEEE Communications Society, 2007 : 1109- 1117.
  • 8ZHANG Xiao, MOHANTY S R, BHUYAN L N, et al. Adaptive max- min fair scheduling in buffered crossbar switches without speedup [ C ]//Proc of IEEE INFOCOM. Washington DC : IEEE Communica- tions Society ,2007:454-462.
  • 9PAN Deng, MAKKI K, PISSINOU N. Fair queueing based packet scheduling for buffered crossbar switches [ C ]//Proc of the 28th IEEE Global Communications Conference. Piscataway, N J: IEEE Press, 2009 : 1592-1597.
  • 10HE Si-min, SUN Shu-tao, GUAN Hong-tao, et al. On guaranteed smooth switching for buffered crossbar switches [ J ]. IEEE ACM Trans on Networking,2008,16(3 ) :718-731.

二级参考文献28

  • 1Texas Instruments. GS400.15-μ_m CMOS, Standard Cell/Gate Array. 2001. http://www.ti.com/
  • 2Tamir Y, Frazier G. High performance multi-queue buffers for VLSI communication switches. In: Siegel HJ, ed. Proc. of the 15th Annual Symp. Computer Architecture. Honolulu: IEEE Communications Society, 1988. 343-354.
  • 3Network Processing Forum Benchmarking Working Group. Traffic Models, 2003.
  • 4Rojas-Cessa R, Oki E, Jing Z, Chao HJ. On the combined input-crosspoint buffered switch with round-robin arbitration. IEEE Trans. on Communications, 2005,11 : 1945-1951.
  • 5Floyd S, Jacobson V. Random early detection gateways for congestion avoidance. IEEE/ACM Trans. on Networking, 1993,1(4): 397-413.
  • 6Shreedhar M, Varghese G. Efficient fair queuing using deficit round-robin. IEEE/ACM Trans. on Networking, 1996,4(3):375-385.
  • 7Katevenis M, Sidiropoulos S, Courcoubetis C. Weighted round-robin cell multiplexing in a general-purpose ATM switch chip. IEEE Journal on Selected Areas in Communications, 1991,9(8): 1265-1279.
  • 8Garg R, Chen X. RRR: Recursive round robin scheduler. Computer Networks, 1999,31 : 1951-1966.
  • 9Goyal P, Vin HM. Start-Time fair queueing: A scheduling algorithm for integrated services packet switching networks. IEEE/ACM Trans. on Networking, 1997,5(5):690-703.
  • 10Demers AJ, Keshav S, Shenker S. Analysis and simulation of a fair queueing algorithm. In: Landweber LH, ed. Proc. of the ACM SIGCOMM '99. Austin: ACM Press, 1989. 1-12.

共引文献18

同被引文献5

引证文献1

二级引证文献1

计算机应用研究
2011年 第10期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
关于我们 | 版权声明 | 联系我们 | 帮助中心| 意见反馈
主办单位：上海市教育委员会
技术支持：重庆维普资讯有限公司
渝公网安备 50019002500403号
使用帮助 返回顶部