Control Algorithms for Rearrangeable Clos Networks

Recently interest in rearrangeable Clos networks has risen again, due to their potential uses in data networks and computing systems. Much research has been directed towards the construction of efficient control algorithms. However, the literature has seemed not to be aware of an important link between the control algorithms and the edge coloring algorithms for bipartite graphs. In this paper we show that a recent edge coloring algorithm of Gabow can be used to obtain a control algorithm faster than any existing one.