### Abstract

In this paper we show that even if every node or edge in an N-node butterfly network fails independently with some constant probability, p, it is still possible to identify a set of Θ(N) nodes between which packets can be routed in any permutation in O(log N) steps, with high probability. Although the analysis is complicated, the routing algorithm itself is relatively simple.

Original language | English (US) |
---|---|

Title of host publication | Annual Symposium on Foundations of Computer Science - Proceedings |

Editors | Anon |

Publisher | IEEE |

Pages | 558-570 |

Number of pages | 13 |

State | Published - 1995 |

Event | Proceedings of the 1995 IEEE 36th Annual Symposium on Foundations of Computer Science - Milwaukee, WI, USA Duration: Oct 23 1995 → Oct 25 1995 |

### Other

Other | Proceedings of the 1995 IEEE 36th Annual Symposium on Foundations of Computer Science |
---|---|

City | Milwaukee, WI, USA |

Period | 10/23/95 → 10/25/95 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture

### Cite this

*Annual Symposium on Foundations of Computer Science - Proceedings*(pp. 558-570). IEEE.

**Routing on butterfly networks with random faults.** / Cole, Richard; Maggs, Bruce; Sitaraman, Ramesh.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Annual Symposium on Foundations of Computer Science - Proceedings.*IEEE, pp. 558-570, Proceedings of the 1995 IEEE 36th Annual Symposium on Foundations of Computer Science, Milwaukee, WI, USA, 10/23/95.

}

TY - GEN

T1 - Routing on butterfly networks with random faults

AU - Cole, Richard

AU - Maggs, Bruce

AU - Sitaraman, Ramesh

PY - 1995

Y1 - 1995

N2 - In this paper we show that even if every node or edge in an N-node butterfly network fails independently with some constant probability, p, it is still possible to identify a set of Θ(N) nodes between which packets can be routed in any permutation in O(log N) steps, with high probability. Although the analysis is complicated, the routing algorithm itself is relatively simple.

AB - In this paper we show that even if every node or edge in an N-node butterfly network fails independently with some constant probability, p, it is still possible to identify a set of Θ(N) nodes between which packets can be routed in any permutation in O(log N) steps, with high probability. Although the analysis is complicated, the routing algorithm itself is relatively simple.

UR - http://www.scopus.com/inward/record.url?scp=0029487216&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029487216&partnerID=8YFLogxK

M3 - Conference contribution

SP - 558

EP - 570

BT - Annual Symposium on Foundations of Computer Science - Proceedings

A2 - Anon, null

PB - IEEE

ER -