By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Batovski, D.A. ; Dept. of Telecommun. Sci., Assumption Univ., Bangkok, Thailand

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 ≤ 7 are presented in the Appendix.

Published in:

Communication Systems, 2002. ICCS 2002. The 8th International Conference on  (Volume:2 )

Date of Conference:

25-28 Nov. 2002