Packet scheduling in input-queued switches with a speedup of less than two and scheduling algorithms for switches with a configuration overhead

In the second part of the paper, we apply the techniques developed for networks with variable packet size to the design of a scheduling algorithm for switches with large configuration overhead. We design a maximal weight matching algorithm for a switch with configuration overhead and determine the minimum speedup required to guarantee the stability of the switch.