The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2001 vol.50)
pp: 1291-1294
ABSTRACT
<p><b>Abstract</b>—This paper proposes a three-stage rearrangeable polygonal switching network (PSN) for interconnecting one-sided input-output terminals. In comparing our PSN with a three-stage one-sided Clos switching network of the same size and with the same number of switches, we prove that rearrangeability of a PSN is better than that of a Clos switching network. Also, the switches efficiency of PSN is explored.</p>
INDEX TERMS
Rearrangeable, switching network, polygonal switching network.
CITATION
Mao-Hsu Yen, Sao-Jie Chen, Sanko H. Lan, "A Three-Stage One-Sided Rearrangeable Polygonal Switching Network", IEEE Transactions on Computers, vol.50, no. 11, pp. 1291-1294, November 2001, doi:10.1109/12.966502
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool