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

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 nonunif...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE Transactions on communications 49, 7 (2001).
1. Verfasser: Cheng-Shang Chang
Format: Artikel
Sprache:English
Schlagworte:
Birkhoff-von Neumann input-buffered crossbar switches.
N×N switch.
Doubly sub-stochastic matrix decomposition.
Guaranteed-rate services.
Nonuniform traffic.
On-line computational complexity.
On-line memory complexity.
Scheduling algorithm.