Decomposition of modular destination graphs for many-many packet routing in multi-link binary hypercubes

The paper considers the existence of oblivious many-many packet routing in multi-link binary hypercubes. Modular destination graphs are decomposed according to a certain number of links for a particular dimension n of the hypercube in order to establish conflict-free tight minimum routing within a network cycle consisting of n hops. Quasi-dimension-order routing is applied, where the replacements of the unidentical bit positions between source and destination are cyclic. Sample results of graph decomposition for a number of dimensions n /spl les/ 7 are presented in the Appendix.