Issue No. 10 - October (1995 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.473514
<p><it>Abstract</it>—A new multipath multistage interconnection network called the composite banyan network is proposed. The network incorporates both the banyan and the reverse banyan networks and is constructed by superimposing the two. The basic building blocks in the composite banyan network are 3 × 3 switching elements with <it>log</it><sub>2</sub><it>N</it> stages. A major advantage of the composite banyan network over existing networks with 3 × 3 SEs is an efficient and fast control algorithm that sets up a path between any source and destination pair. Instead of complex numerical calculations, the network can easily generate a primary routing tag and alternate tags through simple binary operations. Also, the network has a lot of favorable features, including regularity, symmetry, and easy rerouting capability under faults and conflicts. It is shown that at least two totally disjoint paths exist between any source and destination pair, which increase the degree of fault-tolerance. A deterministic permutation routing algorithm is also developed for the 8 × 8 composite banyan network. Using a simple tabular method, it is shown that the algorithm always finds a set of conflict-free tags.</p>
Interconnection networks, composite banyan network, topology-describing functions, primary and alternate routing tags, binary weights, permutation routing algorithm.
Seung-Woo Seo, Tse-Yun Feng, "The Composite Banyan Network", IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 1043-1054, October 1995, doi:10.1109/71.473514