𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fault-Tolerant Permutation Routing in Hypercubes

✍ Scribed by Mee Yee Chan; Shiang-Jen Lee

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
408 KB
Volume
17
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fault-Tolerant Multicasting on Hypercube
Fault-Tolerant Multicasting on Hypercubes
✍ A.C. Liang; S. Bhattacharya; W.T. Tsai πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 912 KB

Multicast (one-to-many) communication has important applications in parallel architecture and communication networks. This paper considers the multicast problem for a \(d\) dimensional binary hypercube in the presence of \(F\) link failures, where \(F<d\). We develop a fault-tolerant (FT) multicast

Fault-Tolerant Convergence Routing
Fault-Tolerant Convergence Routing
✍ BΓΌlent Yener; Inderpal Bhandari; Yoram Ofek; Moti Yung πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 286 KB

This paper presents fault-tolerant protocols for fast packet switch networks with convergence routing. The objective is to provide fast reconfiguration and continuous host-to-host communication after a link or a node (switch) failure, Convergence routing can be viewed as a variant of deflection rout

Highly Fault-Tolerant Routings and Fault
Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs
✍ Koichi Wada; Takaharu Ikeo; Kimio Kawaguchi; Wei Chen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 130 KB

Consider a communication network G in which a limited number of link and/or node faults F might occur. A routing ρ for the network (a fixed path between each pair of nodes) must be chosen without knowing which components might become faulty. The diameter of the surviving route graph R(G, ρ)/F, where

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