A Novel Scheduling Scheme with Bandwidth Guarantees in the Multiple-Plane and Multiple-Stage Packet Switching Fabric

Cherry S. The battle for broadband (Internet protocoltelevision) [J]. IEEE Spectrum, 2006, 42(1): 24-29.[2]Newman H B, Ellisman M H, and Orcutt J A. Data-intensiveE-science frontier research [J]. Communnication of the ACM,2005, 46(11): 68-77.[3]Ma Xiangjie and Lan Julong. Emulating output queueingwith the central-stage buffered Clos packet switching network[C]. IEEE Conference on High Performance Switching andRouting, Shanghai, China, May, 2008: 98-103.[4]Mekkittikul A and McKeown N. A practical schedulingalgorithm for achieving 100% throughput in input-queuedswitches [C]. IEEE INFOCOM Proceedings, San Francisco,USA, 2006: 792-799.[5]Chiussi F M, Kneuer J G, and Kumar V P. Low-cost scalableswitching solutions for broadband networking: TheATLANTA architecture and chipset [J]. IEEECommunnication Magzine, 1997, 5(2): 44-53.[6]McKeown N. The iSLIP scheduling algorithm for inputqueuedswitches [J].IEEE/ACM Trans. on Networking.1999,7(2):188-200[7]Oki E, Jing Z, and Chao H J. Concurrent rounrobindispatching scheme for Clos-network switches [J].IEEE/ACM Trans. on Networking.2001, 10(6):830-844[8]Chiussi F, Gerla M, and Sivaraman V. Traffic shaping forend-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浏览