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

A fault-tolerant routing scheme in dynamic networks

โœ Scribed by Xiushan Feng; Chengde Han

Publisher
Springer
Year
2001
Tongue
English
Weight
767 KB
Volume
16
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fault-tolerant wormhole routing for hype
Fault-tolerant wormhole routing for hypercube networks
โœ Jau-Der Shih ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 145 KB

We present an adaptive fault-tolerant wormhole routing algorithm for hypercubes by using 3 virtual networks. The routing algorithm can tolerate at least n -1 faulty nodes and can route a message via a path of length no more than the shortest path plus four. Previous algorithms which achieve the same

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