Birkhoff-von Neumann input-buffered crossbar switches for guaranteed-rate services

Based on a decomposition result by Birkhoff (1946) and von Neumann (1953) for a doubly sub-stochastic matrix, in this letter we propose a scheduling algorithm that is capable of providing guaranteed-rate services for input-buffered crossbar switches. Our guarantees are uniformly good for all nonuniform traffic. The computational complexity to identify the scheduling algorithm is O(N/sup 4.5/) for an N/spl times/N switch. Once the algorithm is identified, its on-line computational complexity is O(log N) and its on-line memory complexity is O(N/sup 3/ log N).