Packet scheduling in input - queued switches with a speedup of less than two

Abstract

Input queued switches and the solution of input/output contention by scheduling algorithms have been widely investigated. Most research has focused on fixed-she packets. This contrasts with the variable size of ~p networks. In this ~ a ~ e r . we investieate how the elass of a speedup of S,S 2 1, if it works at a speed s times faster than the speed of the input links. The less cornPlex and with regard to a chosen metric less Optimal maximal matching algorithms have been widely researched . . I maximal matching algorithms deployed in switches with a speedup of less than two can he modified to take into account the varying packet sizes. Using a novel model for the dynamics of maximal matching algorithms, we show that modified maximal matching algorithms guarantee stability of the switch and establish bounds on the average delay experienced by a packet.