A rearrangement algorithm for switching networks composed of digital symmetrical matrices (Q1573379)

The goal of this paper is to study 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^2)\) time complexity, where \(r\) is the number of input (output) switches. We also show that \(r-1\) is an upper bound on the number of existing connections that need to be rearranged in order to realize a connection request.