[1] Oki E, Jing Zhigang, Rojas C 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] Pun K H, Hamdi M. Static round-robin dispatching schemes for Clos-network switches[C]//Workshop on High Performance Switching and Routing. Kobe: IEEE, 2002: 329-333.[3] Rojas C R, Oki E, Chao H J. Maximum and maximal weight matching dispatching schemes for MSM Clos-network packet switches [J]. IEICE Transactions on Communications, 2010, 93(2): 297-304.[4] Giaccone P, Prabhakar B, Shah D. Randomized scheduling algorithms for high-aggregate bandwidth switches [J]. IEEE Journal on Selected Areas in Communications, 2003, 21(4): 546-559.[5] Lin B, Keslassy I. The concurrent matching switch architecture [J]. IEEE /ACM Transactions on Networking, 2010, 18(4): 1330-1343.[6] Mckeown N, Mekkittikul A, Anantharam V, et al. Achieving 100% throughput in an input-queued switch[J]. IEEE Transactions on Communications, 1999, 47(8): 1260-1267. |