Fast fault-tolerant parallel communication for de Bruijn networks using information dispersal

2002 ◽  
Author(s):  
Yuh-Dauh Lyuu
Keyword(s):  
Fault Tolerant ◽  
De Bruijn ◽  
Information Dispersal ◽  
Parallel Communication

Fault-Tolerant Parallel Communication in the Star Network

1997 ◽  
Vol 07 (01) ◽  
pp. 57-68 ◽  
Author(s):  
A. A. Rescigno
Keyword(s):  
Fault Tolerant ◽  
Routing Algorithm ◽  
Star Graph ◽  
Star Network ◽  
Probability Of Success ◽  
Information Dispersal ◽  
Parallel Communication

In this paper we study the problem of fault-tolerant parallel routing in the star network, i.e., we assume that all processors send packets according to the prescribed protocol but some packets may fail to reach (on time) their destination. Using the Information Dispersal Algorithm (IDA) we obtain a fault-tolerant randomised routing algorithm whose probability of success is 1 - N-Θ(n), where N = n! is the number of nodes of the star graph Sn.

scholarly journals Fault-tolerant routings in Kautz and de Bruijn networks

1989 ◽  
Vol 24 (1-3) ◽  
pp. 179-186 ◽  
Author(s):  
Nathalie Homobono ◽  
Claudine Peyrat
Keyword(s):  
Fault Tolerant ◽  
De Bruijn

Fault—tolerant hypercube broadcasting via information dispersal

Networks ◽  
1993 ◽  
Vol 23 (4) ◽  
pp. 271-282 ◽  
Author(s):  
L. Gargano ◽  
A. A. Rescigno ◽  
U. Vaccaro
Keyword(s):  
Fault Tolerant ◽  
Information Dispersal
Sign in / Sign up

Export Citation Format

Share Document