The enhanced Birkhoff-von Neumann (1953) decomposition (EBVND) algorithm, a new class of scheduling arbitrators for input queued (IQ) crossbar switches that is based on the Birkhoff-von Neumann decomposition algorithm, is introduced. Theoretical analysis shows that the performance of EBVND is better than the Birkhoff-von Neumann decomposition algorithm in terms of throughput and cell delay, and can also provide rate and cell delay guarantees. Also, the weighted rate filling algorithm (WRFA), a new algorithm that can be used to construct doubly stochastic matrices from doubly substochastic matrices with less complexity and better fairness, is proposed. The wavefront Birkhoff-von Neumann decomposition (WFBVND) algorithm and its simplified version WFBVND with logN iterations (WFBVND-logN), the special cases of EBVND, are also introduced and evaluated. Simulations show that the WFBVND and WFBVND-logN algorithms have much lower average cell delay as compared to the Birkhoff-von Neumann decomposition algorithm.
[1]
Thomas E. Anderson,et al.
High-speed switch scheduling for local-area networks
,
1993,
TOCS.
[2]
Samuel P. Morgan,et al.
Input Versus Output Queueing on a Space-Division Packet Switch
,
1987,
IEEE Trans. Commun..
[3]
Yuval Tamir,et al.
Symmetric Crossbar Arbiters for VLSI Communication Switches
,
1993,
IEEE Trans. Parallel Distributed Syst..
[4]
Nick McKeown,et al.
A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch
,
1999
.
[5]
John von Neumann,et al.
1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem
,
1953
.