[4] [4] MEKKITTIKUL A, MCKEOWN N. A starvation-free algorithm for achieving 100% throughput in an input-queued switch [C]//IEEE. Proceedings of International Conference on Communication Networks. Las Vegas: IEEE, 1996, 96: 226-231.

[5] [5] 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-1260.

[6] [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-1260.

[8] [8] ANDERSON T E, OWICKI S S, SAXE J B, et al. High-speed switch scheduling for local-area networks[J]. ACM Transactions on Computer Systems, 1993, 11(4): 319-352.

[9] [9] MCKEOWN N, VARAIYA P, WALRAND J. Scheduling cells in an input-queued switch[J]. Electronics Letters, 1993, 29(25): 2174-2175.

[10] [10] MCKEOWN N. The iSLIP scheduling algorithm for input-queued switches[J]. IEEE/ACM Transactions on Networking, 1999, 7(2): 188-201.

[12] [12] CHAO J. Saturn: a terabit packet switch using dual round-robin [J]. IEEE Communications Magazine: Articles, News, and Events of Interest to Communications Engineers, 2000, 38(12): 78-84.

[13] [13] HAN K E, SONG J, KIM D U, et al. Grant-aware scheduling algorithm for VOQ-based input-buffered packet switches[J]. ETRI Journal, 2018, 40(3): 337-346.

[14] [14] HU B, FAN F, YEUNG K L, et al. Highest rank first: a new class of single-iteration scheduling algorithms for input-queued switches [J]. IEEE Access, 2018, 6: 11046-11062.

[15] [15] DEVI R C, FLORINABEL D J, PRASANTH N. High throughput scheduling algorithms for input queued packet switches [J]. CMC-Computers Materials & Continua, 2022, 70(1): 1527-1540.

[17] [17] COHEN I, SCALOSUB G. Queueing in the mist: buffering and scheduling with limited knowledge[J]. Computer Networks, 2018, 147: 204-220.

[18] [18] AL-BAWANI K, ENGLERT M, WESTERMANN M. Online packet scheduling for CIOQ and buffered crossbar switches[C]//ACM. Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures. Boston: ACM, 2016: 241-250.