Self-routing in >2D shuffle networks by d-tuples

Massive parallel optical interconnection systems in the 3-D physical space offer advantages but they also represent serious difficulties caused by the increase of the degree of freedom. These difficulties are mainly (1) packaging and precise mounting but also (2) problems of combinatorial nature. Throughout the paper, the presentation of routing information in greater than or equal to 2-D MINs is discussed and the results are aimed to avoid delay and additional hardware. The results apply to distributed switching and processing under the optical interconnection regime.