Novel algorithm networks for Clos-type networks

11 October 1990

journal article
Published by Institution of Engineering and Technology (IET) in Electronics Letters

Vol. 26 (21) , 1772-1774
https://doi.org/10.1049/el:19901138

Abstract

A new routing algorithm for controlling nonblocking Clos-type permutation networks is presented. Unlike previous algorithms based on matrix decomposition and looping techniques, the algorithm uses a new method called scheduling, does not use iterations, and has execution time 0(Nr^1/2) where N is the total number of ports, and r is the number of first-stage switches.

Keywords

NONBLOCKING CLOS-TYPE PERMUTATION NETWORKS
EXECUTION TIME
SWITCHING NETWORKS
LOOPING TECHNIQUES
ROUTING ALGORITHM
FIRST-STAGE SWITCHES
SCHEDULING
MATRIX DECOMPOSITION

This publication has 0 references indexed in Scilit: