On the rearrangeability of switching networks composed of digital symmetrical matrices
D.T. Huynh, Hai N. Nguyen · 2002
This paper studies the rearrangeability of switching networks composed of digital symmetrical matrices (DSM networks). We describe an efficient rearrangement algorithm for rearrangeable DSM networks with O(r/sup 2/) time complexity, where r is the number of input (output) switches. We also show that r-1 is an upper bound an the number of existing connections that need to be rearranged in order to realize a connection request.>