The Switch Structure and Scheduling Algorithm for Maintaining Packet Order in Multistage Switching Fabric

Oki E, Jing Zhi-gang, and Rojas-Cessa R, et al.. Concurrent round-robin-based dispatching schemes for clos-network switches[J].IEEE/ACM Transactions on Networking.2002, 10(6):830-844[2]Chiussi F M, Kneuer J G, and Kumar V P. Low-cost scalable switching solutions for broadband networking: The ATLANTA architecture and chipset[J]. IEEE Communications Magazine, 1997, 35(12): 44-53.[3]Chrysos N and Katevenisz M. Scheduling in non-blocking buffered three-stage switching fabrics[C]. Proc. IEEE Globecom2006, Francisco, IEEE Computer Society, 2006: 6-13.Wang Feng, Zhu Wen-qi, and Hamdi M. The central-stage buffered clos-network to emulate an OQ switch[C]. Proc. IEEE Globecom2006, Francisco, IEEE Computer Society, 2006: 1-5.[4]Li X and Elhanany I. A scalable frame-based multi-crosspoint packet switching architecture[C]. Proc. HPSR, Brooklyn, USA, 2007: 61-65.盛友招. 排队论及其在现代通信中的应用[M]. 北京: 人民邮电出版社, 2007: 50-55.[5]Shen Yanming, Panwar S S, and Chao H J. Providing 100% throughput in a buffered crossbar switch[C]. Proc. HPSR, Brooklyn, USA. 2007: 1-8.[6]Iyer S and Mckeown N. Making parallel switches practical[C]. Proc. INFOCOM2001, Alaska, IEEE Computer Society, 2001: 1680-1687.[7]杨君刚, 鲍民权, 刘增基等. 一种具有信元保序能力的Clos网络分布式调度算法[J]. 计算机学报, 2008, 31(3): 467-475.Yang Jun-gang, Bao Min-quan, and Liu Zeng-ji, et al.. A distributed scheduling algorithm maintaining cells order for three-stage clos networks[J].Chinese Journal of Computers.2008, 31(3):467-475[8]兰巨龙, 董雨果, 陈越, 温建华. 并行交换中支持包保序的缓存结构及调度算法[J]. 电子学报, 2004, 32(12): 35-38.Lan Ju-long, Dong Yu-guo, Chen Yue, and Wen Jian-hua. The buffer structure and scheduling algorithm for maintaining packet order in the parallel switch[J]. Acta Electronica Sinica, 2004, 32(12): 35-38.