Translator Disclaimer
February, 1993 Randomly Wired Multistage Networks
Bruce M. Maggs
Statist. Sci. 8(1): 70-75 (February, 1993). DOI: 10.1214/ss/1177011086

Abstract

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.

Citation

Download Citation

Bruce M. Maggs. "Randomly Wired Multistage Networks." Statist. Sci. 8 (1) 70 - 75, February, 1993. https://doi.org/10.1214/ss/1177011086

Information

Published: February, 1993
First available in Project Euclid: 19 April 2007

zbMATH: 0782.68015
Digital Object Identifier: 10.1214/ss/1177011086

Rights: Copyright © 1993 Institute of Mathematical Statistics

JOURNAL ARTICLE
6 PAGES


SHARE
Vol.8 • No. 1 • February, 1993
Back to Top