Randomly wired multistage networks


Journal Article

Randomly wired multistage networks have recently been shown to outperform traditional multistage networks in three respects. First, they have fast deterministic packet-switching and circuit-switching algorithms for routing permutations. Second, they are nonblocking, and there are on-line algorithms for establishing new connections in them, even if many requests for connections are made simultaneously. Finally, and perhaps most importantly, they are highly fault tolerant. © 1993, Institute of Mathematical Statistics. All Rights Reserved.

Full Text

Duke Authors

Cited Authors

  • Maggs, BM

Published Date

  • January 1, 1993

Published In

Volume / Issue

  • 8 / 1

Start / End Page

  • 70 - 75

International Standard Serial Number (ISSN)

  • 0883-4237

Digital Object Identifier (DOI)

  • 10.1214/ss/1177011086

Citation Source

  • Scopus