Fixed-depth interconnection networks

Interconnection networks that have D stages with K ×K switches, where D and K are powers of 2, are analyzed. The number of stages is held fixed irrespective of the number of processing elements in the system. These networks lie somewhere in the range between single-stage and multistage networks. The performance of these networks in terms of delay time for one-to-one connections, hardware complexity, and permuting abilities are considered. Routing tag schemes for routing data items through the network are presented. The D-stage network is compared with two well-known multistage networks in terms of the above-mentioned performance parameters