A three-stage one-sided rearrangeable polygonal switching network
Journal
IEEE Transactions on Computers
Journal Volume
50
Journal Issue
11
Pages
1291-1294
Date Issued
2001
Author(s)
Abstract
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 switching efficiency of the PSN is explored.
SDGs
Type
journal article
