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

Author

Batovski, Dobri Atanassov

Author_Institution

Dept. of Telecommun. Sci., Assumption Univ., Bangkok, Thailand

Volume

2

fYear

2002

fDate

25-28 Nov. 2002

Firstpage

1202

Abstract

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.

Keywords

graph theory; packet switching; telecommunication network routing; conflict-free tight minimum routing; graph decomposition; many-many packet routing; modular destination graphs; multi-link binary hypercubes; network cycle; quasi-dimension-order routing; unidentical bit positions; Computer Society; Hypercubes; Laboratories; Optical fiber networks; Optical interconnections; Optical packet switching; Parallel processing; Routing; Switching circuits; Wavelength division multiplexing;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Systems, 2002. ICCS 2002. The 8th International Conference on

Print_ISBN

0-7803-7510-6

Type

conf

DOI

10.1109/ICCS.2002.1183324

Filename

1183324