Stability of frame-based maximal weight matching algorithms with reconfiguration delays

It has been shown that maximal weight matching algorithms for input-queued switches are stable under any admissible traffic conditions with a speedup of 2. As link speeds increase, the computational complexity of these algorithms limits their applicability in high port-density switches and routers. In frame-based maximal weight matching (FMWM), a new scheduling decision is generated once every several packet times, as opposed to on a packet-by-packet basis. Between new scheduling decisions, the configuration of the crossbar switch remains unchanged. We show that the FMWM algorithm is also stable with a speedup of 2 and obtain the speedup required for stability in systems with non-negligible reconfiguration delays. Simulation results illustrate the impact of the frame size on the delay experienced by arriving packets under different traffic scenarios.