𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distributed Fault-Tolerant Routing in Kautz Networks

✍ Scribed by W.K. Chiang; R.J. Chen

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
628 KB
Volume
20
Category
Article
ISSN
0743-7315

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
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