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

Space-efficient information dispersal algorithm (IDA) is applied to fault-tolerant parallel communication in the de Bruijn network. Let N=d/sup n /denote the size of the network. The author's routing scheme runs in 2.n+1 time using constant size buffers (if the routing information is not counted). For d=(n ln n) (hence n approximately ln N/ln ln N), its probability of successful routing is at least 1-N/sup -ln/ /sup N/2/. The scheme runs within the said time bound without queueing delay and tolerates O(N) random link failures with probability at least 1-N/sup -ln/ /sup ln/ /sup n/12/.<
>