- Randomly wired multistage networks. B. M. Maggs.
Statistical Science, Vol. 8, No. 1, February, 1993, pp. 70-75.
- 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.
- Back to other
- Back to my home page