๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fast permutation routing in a class of interconnection networks

โœ Scribed by Ehab S. Elmallah; Chin-Hung Lam

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
126 KB
Volume
40
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Routing Properties of a Recursive Interc
Routing Properties of a Recursive Interconnection Network
โœ Rocky K.C. Chang; Hong Y. Wang ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 178 KB

In this paper, we consider a highly recursive interconnection network known as the fully connected cubic network (FCCN). By exploiting its recursive properties, we thoroughly analyze the performance of a simple routing algorithm for the FCCN. We show that at least 800 of the routes obtained from thi

Optimal routing in shortest-path data ne
Optimal routing in shortest-path data networks
โœ K. G. Ramakrishnan; Manoel A. Rodrigues ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Institute of Electrical and Electronics Engineers ๐ŸŒ English โš– 249 KB ๐Ÿ‘ 1 views
Routing a Permutation in the Hypercube b
Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths
โœ Qian-Ping Gu; Hisao Tamaki ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 95 KB

Consider a hypercube regarded as a directed graph, with one edge in each direction between each pair of adjacent nodes. We show that any permutation on the hypercube can be partitioned into two partial permutations of the same size so that each of them can be routed by edge-disjoint directed paths.