Simultaneous connections routing in multi-log/sub 2/N switching fabrics

Conditions for successful packet routing in multi-log/sub 2/N switching fabrics are considered. Normally, a rearrangeable switching fabric is sufficient to route all conflict-free packets simultaneously. Path selection algorithms, based on graph coloring or finding the perfect matching, are used in this case. Another group of algorithms is based on matrix decomposition. We consider the simple sequential algorithm for routing conflict-free packets in the multi-log/sub 2/N switching fabric. When n is even, the sequential algorithm needs the same number of planes as rearrangeable switching fabrics to route all possible permutations. For n odd, the number of planes needed is greater than for rearrangeable ones.