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

Fault-tolerant de Bruijn and shuffle-exchange networks

โœ Scribed by J. Bruck; R. Cypher; Ching-tien Ho


Book ID
126639586
Publisher
IEEE
Year
1994
Tongue
English
Weight
672 KB
Volume
5
Category
Article
ISSN
1045-9219

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Embedding de Bruijn, Kautz and shuffle-e
โœ Toru Hasunuma; Yukio Shibata ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 839 KB

We show that the de Bruijn digraph B(d,D), D > 1 and the Kautz digraph K(d,D) can be embedded in (d + 1) pages with cumulative pagewidth ~dDe2(3d3 -2d2 + 4d -d(d mod 2) ~ 4) and idD-'(3d' + 4d + (d mod2)), respectively. Also we show that the shuffle-exchange graph S(D; D > 2 can be embedded in 3 pag

Shortest path routing and fault-tolerant
โœ Mao, Jyh-Wen; Yang, Chang-Biau ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 170 KB ๐Ÿ‘ 1 views

In this paper, we study the routing problem for the undirected binary de Bruijn interconnection network. Researchers have never proposed a shortest path routing algorithm on the undirected binary de Bruijn network. We first propose a shortest path routing algorithm, whose time complexity in the bina