On the performance of advanced stable matching algorithms in combined input output queued network switches

Combined input output queued switches have emerged as one solution to overcome speedup problems in pure output queued switches. It has been shown that a speedup of two is sufficient to exactly mimic the behavior of an output queued switch when a stable matching algorithm is used. Over the years, a number of advanced stable matching algorithms have been developed and their use is also suggested for network switches. While these algorithms provide considerable improvement for a reference application to which they usually refer, the conditions encountered in a network switch are typically very different. A mathematical analysis and simulation results for a key parameter in stable matchings will be presented. It will be argued that the reduction of iterations with advanced stable matching algorithms in network switches is very limited.