✦ LIBER ✦

Fault-tolerant routings in chordal ring networks

✍ Scribed by Lali Barrière; Josep Fàbrega; Ester Simó; Marisa Zaragozá

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 378 KB
Volume: 36
Category: Article
ISSN: 0028-3045
DOI: 10.1002/1097-0037(200010)36:3<180::aid-net5>3.0.co;2-r

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

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

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