Guaranteed smooth switch scheduling with low complexity

S.R. Mohanty, L.N. Bhuyan
2005 GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.  
A smooth scheduling with guaranteed rate service and bounded packet delay is a desired objective of any switch scheduling algorithm. We present a scheme that generates low jitter schedules with low computational complexity. The scheduler uses an integer decomposition of the rate-matrix, similar to the Birkhoff-von Neumann decomposition. It improves the delay and jitter performance of the smooth scheduler as described in Keslassy et. al. with an increase in the number of permutation matrices
more » ... the switch fabric has to cycle through. This increase is shown to be a constant for all practical purposes. Two algorithms are presented that have time complexity ¢ ¡ ¤ £ ¦ ¥ § © £ and space complexity ¢ ¡ ¤ £ ¥ and ¢ ¡ ¤ £ respectively. An existing scheduling algorithm for single links, Smoothed Round Robin, is employed for scheduling the permutation matrices. This algorithm has a computational complexity overhead of ¢ ¡ and ensures smooth scheduling.
doi:10.1109/glocom.2005.1577699 dblp:conf/globecom/MohantyB05 fatcat:opwpavhoebegzjsbajpinteu4i