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

On fault-tolerant fixed routing in hybercubes

โœ Scribed by Abhijit Sengupta; Suresh Viswanathan

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
730 KB
Volume
51
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Cluster fault-tolerant routing in star g
Cluster fault-tolerant routing in star graphs
โœ Gu, Qian-Ping; Peng, Shietung ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 150 KB ๐Ÿ‘ 2 views

Fault-tolerant routing is a key issue in computer/ communication networks. We say a network (graph) can tolerate l faulty nodes for a routing problem if after removing at most l arbitrary faulty nodes from the graph the routing paths exist for the routing problem. However, the bound l is usually a w

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

Cooperative Diagnosis and Routing in Fau
Cooperative Diagnosis and Routing in Fault-Tolerant Multiprocessor Systems
โœ D.M. Blough; H.Y. Wang ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 671 KB

In this note, we consider the problem of fault-tolerant routing in multiprocessor systems when incomplete, or partial, diagnostic information is available. We first define a new type of partial diagnosis, known as \(k\)-reachability diagnosis. The overhead for \(k\)-reachability diagnosis increases