Shortest path routing algorithm using Hopfield neural network

被引:42
作者
Ahn, CW
Ramakrishna, RS
Kang, CG
Choi, IC
机构
[1] Kwang Ju Inst Sci & Technol, Dept Informat & Commun, Puk Gu, Kwangju 500712, South Korea
[2] Korea Univ, Sch Elect Engn, Sungbuk Ku, Seoul 136701, South Korea
[3] Korea Univ, Dept Ind Engn & Informat Syst, Sungbuk Ku, Seoul 136701, South Korea
关键词
D O I
10.1049/el:20010800
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A near-optimal routing algorithm employing a modified Hopfield neural network (HNN) is presented. Since it uses every piece of information that is available at the peripheral neurons, in addition to the highly correlated information that is available at the local neuron, faster convergence and better route optimality is achieved than with existing algorithms that employ the HNN. Furthermore, all the results are relatively independent of network topology for almost all source-destination pairs.
引用
收藏
页码:1176 / 1178
页数:3
相关论文
共 3 条
[1]   NEURAL NETWORKS FOR SHORTEST-PATH COMPUTATION AND ROUTING IN COMPUTER-NETWORKS [J].
ALI, MKM ;
KAMOUN, F .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1993, 4 (06) :941-954
[2]  
HOPFIELD JJ, 1985, BIOL CYBERN, V52, P141
[3]  
Park DC, 1998, IEEE WORLD CONGRESS ON COMPUTATIONAL INTELLIGENCE, P1673, DOI 10.1109/IJCNN.1998.686030