Comparison of neural network algorithms for the optimal routing in a Multistage Interconnection Network

MIN의 최적경로 배정을 위한 신경회로망 알고리즘의 비교

This paper compares the simulated annealing and the Hopfield neural network method for an optimal routing in a multistage interconnection network(MIN). The MIN provides a multiple number of paths for ATM cells to avoid cell conflict. Exhaustive search always finds the optimal path, but with heavy computation. Although greedy method sets up a path quickly, the path found need not be optimal. The simulated annealing can find an sub optimal path in time comparable with the greedy method.