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

一种多级多平面分组交换结构中的带宽保证型调度算法 被引量：3

A Novel Scheduling Scheme with Bandwidth Guarantees in the Multiple-Plane and Multiple-Stage Packet Switching Fabric
下载PDF
导出
摘要 多级多平面分组交换结构MPMS以其优异的可扩展性正成为新一代交换路由设备的交换核心。但MPMS结构中的调度算法却往往比较复杂。该文提出了一种MPMS结构的带宽保证型调度算法BG-CRRD,该算法将分组流预留带宽信息引入判决机制,仿真实验表明,BG-CRRD在Bernoulli均匀流量条件下可以获得100%的吞吐率,在非均匀流量条件极坏情况下获得高达92%的吞吐率,在过载情况下根据预定带宽分配输出链路带宽。 The multiple-plane and multiple-stage （MPMS） switching fabric has attractive scalability features that make it appealing as an alternative for scalable routers. However, scheduling packets in MPMS fabric is complex. In this paper, a novel scheduling scheme is proposed with bandwidth guarantees for the MPMS fabric. It can deliver 100% throughput under Bernoulli uniform traffic, 92% throughput in the worst case under nonuniform traffic and allocate bandwidth according to reserved bandwidth under overloaded traffic.
作者 马祥杰 李秀芹 兰巨龙 张百生
机构地区 解放军信息工程大学信息工程学院 华北水利水电学院信息工程学院
出处 《电子与信息学报》 EI CSCD 北大核心 2009年第6期1475-1478,共4页 Journal of Electronics & Information Technology
基金 国家973重点基础研究发展计划(2007CB307102)资助课题
关键词 调度算法 多级多平面交换结构 并行轮转匹配 iSLIP 带宽保证 Scheduling scheme Multiple-Plane and Multiple-Stage （MPMS） Concurrent Round Robin Dispatching （CRRD） iSLIP Bandwidth guarantee
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献9

  • 1Cherry S. The battle for broadband (Internet protocol television) [J]. IEEE Spectrum, 2006, 42(1): 24-29.
  • 2Newman H B, Ellisman M H, and Orcutt J A. Data-intensive E-science frontier research [J]. Communnication of the A CM, 2005, 46(11): 68-77.
  • 3Ma Xiangjie and Lan Julong. Emulating output queueing with the central-stage buffered Clos packet switching network [C]. IEEE Conference on High Performance Switching and Routing, Shanghai, China, May, 2008: 98-103.
  • 4Mekkittikul A and McKeown N. A practical scheduling algorithm for achieving 100% throughput in input-queued switches [C]. IEEE INFOCOM Proceedings, San Francisco, USA. 2006: 792-799.
  • 5Chiussi F M, Kneuer J G, and Kumar V P. Low-cost scalable switching solutions for broadband networking: The ATLANTA architecture and chipset [J]. IEEE Communnication Magzine, 1997, 5(2): 44-53.
  • 6McKeown N. The iSLIP scheduling algorithm for inputqueued switches [J]. IEEE/ A CM Trans. on Networking, 1999, 7(2): 188-200.
  • 7Oki E, Jing Z, and Chao H J. Concurrent rounrobin dispatching scheme for Clos-network switches [J]. IEEE/ ACM Trans. on Networking, 2001, 10(6): 830-844.
  • 8Chiussi F, Gerla M, and Sivaraman V. Traffic shaping for end-to-end delay guarantees with edf scheduling [C]. International Workshop on Quality of Service, Pittsburgh,USA, June, 2006: 2056-2066.
  • 9马祥杰,李秀芹,兰巨龙,张百生.一种新型可扩展的多级多平面分组交换结构的图论模型与性能分析[J].电子与信息学报,2009,31(5):1026-1030. 被引量：4

二级参考文献8

  • 1Wang F, Zhu Wen-qi, and Hamdi M. The Central-stage buffered Clos-network to emulate an OQ switch[C]. IEEE Globecom Proceedings, California, USA, Nov. 2006: 4244-4257.
  • 2McKeown N. The iSLIP scheduling algorithm for input-queued switches[J]. IEEEIA CM Trans. on Networking, 1999, 7(2): 188-200.
  • 3Mekkittikul A and McKeown N. A practical scheduling algorithm for achieving 100% throughput in input-queued switches[C]. Proceeding of IEEE Infocom, San Francisco, USA, 2004: 792-799.
  • 4Clos C. A study of non-blocking switching networks[J]. Bell Systems Technical Journal, 1953, 32(1): 406-424.
  • 5Goke L R and Lipovski G J. Banyan networks for partitioning processor systems[C]. Proceeding Annual Symp Computer Architecture, USA, Dec. 2003: 21-28.
  • 6Wu C L and Feng T Y. On a class of multistage interconnection networks[J]. IEEE Trans. on Computers, 2000, 29(8): 694-702.
  • 7Pease M C. The indirect binary n-Cube microprocessor array[J]. IEEE Trans. on Computers, 2005, 26(5): 458-473.
  • 8Iyer S and McKeown N. Making parallel packet switches practical[C]. Proceeding of IEEE Infocom, USA, 2001, Vol.3: 1680-1687.

共引文献3

同被引文献30

  • 1MA Xiang-jie, LAN Ju-long. Emulating output queueing with the central-stage buffered clos packet switching network[C]//IEEE Conference on High Performance Switching and Routing. [S.I.]: IEEE, 2008: 98-103.
  • 2MEKKITTIKUL A, MCKEOWN N. A practical scheduling algorithm to achieve 100% throughput in input-queued switches[C]//Proceedings of the 17th Annual Joint Conference of the IEEE Computer and Communications Societies. San Francisco: IEEE, 1998: 792-799.
  • 3CHIUSSI F, GERLA M, SIVARAMAN V. Traffic shaping for end-to-end delay guarantees with EDF scheduling [C]//The 8th International Workshop on Quality of Service. Pittsburgh: IEEE, 2000: 10-18.
  • 4HOPCROFT J E, KARP R M. An n5/2 algorithm for maximum matching in bipartite graphs[J]. SIAM Journal on Computing, 1983, 1(2): 225-231.
  • 5MCKEOWN N, MEKKITTIKL A, ANANTHARAM V, et al. Achieving 100% throughput in an input-queued switch[J] IEEE Transactions on Communications, 1999, 47(8): 1260- 1267.
  • 6NICK M. Scheduling algorithms for input-queued switches [D]. Berkeley, California: University of California, 1995.
  • 7Chao H J, Park J S, Artan S, et al. True Way: A Highly Scalable Multi-plane Multi-stage Buffered Packet Switch[C]//Proc. of IEEE Workshop on High Performance Switching and Routing. [S. 1.]: IEEE Press, 2005: 246-253.
  • 8Oki E, Cessa R R, Chao H J. Concurrent Rotmd-robin-based Dispathing Schemes for Clos-network Switchies[J]. IEEE/ACM Transaction on Networking, 2002, 10(6): 830-844.
  • 9Chao H J, Park J. Flow Control in a Multi-plane Multi-stage Buffered Packet Switch[C]//Proc. of IEEE International Conference on Hybrid Phase Shift Keying. [S. 1.]: IEEE Press, 2007: 1-6.
  • 10Chuang S T, lyer S, McKeown N. Practical Algorithms for Perfor- mance Guarantees in Buffered Crossbars[C]//Proc. of the 24th Annual Joint Conference on Computer and Communications Societies. Miami, USA: [s. n.], 2005: 981-991.

引证文献3

二级引证文献4

电子与信息学报
2009年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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