Randomly wired multistage networks
Publication
, Journal Article
Maggs, BM
Published in: Statistical Science
January 1, 1993
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.
Duke Scholars
Published In
Statistical Science
DOI
ISSN
0883-4237
Publication Date
January 1, 1993
Volume
8
Issue
1
Start / End Page
70 / 75
Related Subject Headings
- Statistics & Probability
- 4905 Statistics
- 0104 Statistics
Citation
APA
Chicago
ICMJE
MLA
NLM
Maggs, B. M. (1993). Randomly wired multistage networks. Statistical Science, 8(1), 70–75. https://doi.org/10.1214/ss/1177011086
Maggs, B. M. “Randomly wired multistage networks.” Statistical Science 8, no. 1 (January 1, 1993): 70–75. https://doi.org/10.1214/ss/1177011086.
Maggs BM. Randomly wired multistage networks. Statistical Science. 1993 Jan 1;8(1):70–5.
Maggs, B. M. “Randomly wired multistage networks.” Statistical Science, vol. 8, no. 1, Jan. 1993, pp. 70–75. Scopus, doi:10.1214/ss/1177011086.
Maggs BM. Randomly wired multistage networks. Statistical Science. 1993 Jan 1;8(1):70–75.
Published In
Statistical Science
DOI
ISSN
0883-4237
Publication Date
January 1, 1993
Volume
8
Issue
1
Start / End Page
70 / 75
Related Subject Headings
- Statistics & Probability
- 4905 Statistics
- 0104 Statistics