Routing Permutations in Partitioned Optical Passive Star Networks

Abstract

It is shown that a POPS network with g groups and d processors per group can efficiently route any permutation among the n=dg processors. The number of slots used is optimal in the worst case, and is at most the double of the optimum for all permutations p such that p(i)<>i for all i.

8 pages, 3 figures