The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1997 vol.46)
pp: 1057-1069
ABSTRACT
<p><b>Abstract</b>—Principles for designing practical self-routing nonblocking <it>N</it>×<it>N</it> circuit-switched connection networks with optimal θ(<it>N</it>· log <it>N</it>) hardware at the bit-level of complexity are described. The overall principles behind the architecture can be described as "Expand-Route-Contract." A self-routing nonblocking network with <it>w</it>-bit wide datapaths can be achieved by expanding the datapaths to <it>w</it> + <it>z</it> independent bit-serial connections, routing these connections through self-routing networks with blocking, and by contracting the data at the output and recovering the <it>w</it>-bit wide datapaths. For an appropriate redundancy <it>z</it>, the blocking probability can be made arbitrarily small and the fault tolerance arbitrarily high. By using efficient space domain concentrators, the architecture yields self-routing nonblocking switching networks with an optimal <it>O</it>(<it>N</it>· log <it>N</it>) bits of memory or <it>O</it>(<it>N</it>· log <it>N</it>· log log log <it>N</it>) logic gates. By using a linear-cost time domain concentrator, the architecture yields self-routing nonblocking switching networks with an optimal θ(<it>N</it>· log <it>N</it>) bits of memory or logic gates. These designs meet Shannon's lower bound on memory requirements, established in the 1950s. The number of stages of crossbars can match the theoretical minimum, which has not been achieved by previous self-routing networks. The architecture is feasible with existing electrical or optical technologies. The designs of electrical and optical switch cores with Terabits of bisection bandwidth for Networks-of-Workstations (NOWs) are described.</p>
INDEX TERMS
Multistage, networks, self-routing, nonblocking, circuit-switching, scalable, randomization, electrical, optical.
CITATION
Ted H. Szymanski, "Design Principles for Practical Self-Routing Nonblocking Switching Networks with O(N · log N) Bit-Complexity", IEEE Transactions on Computers, vol.46, no. 10, pp. 1057-1069, October 1997, doi:10.1109/12.628391
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool