DocumentCode :
2615843
Title :
Neural network implementation of the shortest path algorithm for traffic routing in communication networks
Author :
A. Thomopoulos, Stelios ; Zhang, Lei ; Wann, Chin Der
Author_Institution :
Dept. of Electr. & Comput. Eng., Pennsylvania State Univ., University Park, PA, USA
fYear :
1991
fDate :
18-21 Nov 1991
Firstpage :
2693
Abstract :
A neural network computation algorithm is introduced to solve for the optimal traffic routing in a general N-node communication network. The algorithm chooses multilink paths for node-to-node traffic which minimize a certain cost function. Unlike the algorithm introduced earlier in this area, knowledge of the number of links between each origin-destination pair is not required by the algorithm, therefore it can be applied to variable-length path routing problems. The neural network structure for implementing the algorithm is a modified form of the one used by the traveling salesman algorithm. Computer simulation in a nine- and sixteen-node grid network showed that the algorithm performs extremely well in single and multiple paths
Keywords :
neural nets; optimisation; telecommunication networks; telecommunication traffic; telecommunications computing; communication networks; multilink paths; neural network; node-to-node traffic; optimisation; shortest path algorithm; traffic routing; traveling salesman algorithm; variable-length path routing; Analog computers; Computer networks; Cost function; Delay; Intelligent networks; Joining processes; Neural networks; Neurons; Routing; Telecommunication traffic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 1991. 1991 IEEE International Joint Conference on
Print_ISBN :
0-7803-0227-3
Type :
conf
DOI :
10.1109/IJCNN.1991.170276
Filename :
170276
Link To Document :
بازگشت