Neural network controller for rearrangeable switching networks

A neural network approach to controlling a three-stage Clos network in real time is proposed. This controller provides optimal routing of communication traffic requests on a call-by-call basis by rearranging existing connections with a minimum length of rearrangement sequence so that a new blocked call request can be accommodated. The proposed neural network controller uses Paull´s rearrangement algorithm (1962), along with the special (least used) switch selection rule in order to minimize the length of rearrangement sequences. The functional behavior of the authors´ model is verified by simulations, and it is shown that the convergence time required for finding an optimal solution is constant regardless of the switching network size. The performance is evaluated for random traffic with various traffic loads. Simulation results show that applying the least used switch selection rule increases the efficiency in switch rearrangements, reduces the network convergence time, and also keeps the network from being trapped in local minima. The implementation aspects are discussed