A switch scheduling algorithm for periodic messages using laxity decomposition method

This paper presents a very unique and analytic method for scheduling real time messages routed through a non-blocking switch. The laxities of schedulable messages are decomposed and rearranged so that the packets to be scheduled in the next time instance are placed in the diagonal of the traffic matrix. The MLF algorithm we modified is utilized to schedule the messages. We present some examples and simulation results which show that the success rate is improved significantly regardless of the size of switch.