𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fault-tolerant routings in Kautz and de Bruijn networks

✍ Scribed by Nathalie Homobono; Claudine Peyrat

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
321 KB
Volume
24
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Shortest path routing and fault-tolerant
Shortest path routing and fault-tolerant routing on de Bruijn networks
✍ 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

Fault-tolerant routings in chordal ring
Fault-tolerant routings in chordal ring networks
✍ Lali BarriΓ¨re; Josep FΓ brega; Ester SimΓ³; Marisa ZaragozΓ‘ πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 378 KB πŸ‘ 1 views
De Bruijn and Kautz bus networks
De Bruijn and Kautz bus networks
✍ Bermond, Jean-Claude; Dawes, Robin W.; Ergincan, Fahir οΏ½. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 598 KB

Our aim was to find bus interconnection networks which connect as many processors as possible, for given upper bounds on the number of connections per processor, the number of processors per bus, and the network diameter. Point-to-point networks are a special case of bus networks in which every bus