A new switching algorithm for TSISS network

Time slot interchange and signal separator (TSISS) network was introduced to reduce the time slot requirement of TST architecture. In the switching algorithm of the TSISS network, an adjacency matrix was formed and breath-first search (BFS) or depth-first search (DFS) algorithms was applied on the matrix to find optimal input and output time slots. As time complexity of the algorithm for formation of adjacency matrix and also time complexity of BFS or DFS are non-linear, switching time will increase non-linearly with the increment of number of subscribers. In this paper a new switching algorithm is proposed which forms a distance metric, instead of adjacency matrix. It also utilizes a linear minimum selection algorithm instead of using BFS or DFS to determine the optimal input output time slots. All parts of the proposed algorithm have linear or constant time complexity. As a result, the maximum time complexity of the proposed algorithm is linear. So, switching time will increase linearly with the number of subscribers.