Routing on butterfly networks with random faults

Richard Cole, Bruce Maggs, Ramesh Sitaraman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science - Proceedings
Editors Anon
PublisherIEEE
Pages558-570
Number of pages13
StatePublished - 1995
EventProceedings of the 1995 IEEE 36th Annual Symposium on Foundations of Computer Science - Milwaukee, WI, USA
Duration: Oct 23 1995Oct 25 1995

Other

OtherProceedings of the 1995 IEEE 36th Annual Symposium on Foundations of Computer Science
CityMilwaukee, WI, USA
Period10/23/9510/25/95

Fingerprint

Routing algorithms

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Cole, R., Maggs, B., & Sitaraman, R. (1995). Routing on butterfly networks with random faults. In Anon (Ed.), 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.

Annual Symposium on Foundations of Computer Science - Proceedings. ed. / Anon. IEEE, 1995. p. 558-570.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cole, R, Maggs, B & Sitaraman, R 1995, Routing on butterfly networks with random faults. in Anon (ed.), 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.
Cole R, Maggs B, Sitaraman R. Routing on butterfly networks with random faults. In Anon, editor, Annual Symposium on Foundations of Computer Science - Proceedings. IEEE. 1995. p. 558-570
Cole, Richard ; Maggs, Bruce ; Sitaraman, Ramesh. / Routing on butterfly networks with random faults. Annual Symposium on Foundations of Computer Science - Proceedings. editor / Anon. IEEE, 1995. pp. 558-570
@inproceedings{ac5f4b8fb13749f38e403a5ccb8a422c,
title = "Routing on butterfly networks with random faults",
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.",
author = "Richard Cole and Bruce Maggs and Ramesh Sitaraman",
year = "1995",
language = "English (US)",
pages = "558--570",
editor = "Anon",
booktitle = "Annual Symposium on Foundations of Computer Science - Proceedings",
publisher = "IEEE",

}

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 -