Algorithms for virtual output queued switching

This work presents algorithms and their performance study for virtual output queuing with a speedup of two to emulate output queued switches. The main contributions of this work is to formulate the problem of scheduling packets inside the switch as an instance of 2-matching problem on bipartite weighted graphs and to propose a new approximate solution to the problem. Both exact and approximate solutions are compared on a set of switch configurations.