A neural network based multi-destination routing algorithm for communication network

Author

Park, Dong-Chul ; Choi, Seung-Eok

Author_Institution

Sch. of Electr. & Electron. Eng., MyongJi Univ., South Korea

Volume

2

fYear

1998

fDate

4-9 May 1998

Firstpage

1673

Abstract

A routing algorithm for large scale communication network with multidestination problem is proposed in this paper. The proposed approach consists of three procedures: recursive Hopfield neural network for obtaining the routing order between given source and multiple destinations, a screening procedure for localizing the problem and minimizing the computational effort along with depth-first search method, and an improved version of Hopfield neural network for routing in the large scale communication networks. The results show improvements in both computational performance and solution optimality by the proposed approach over conventional approaches

Keywords

Hopfield neural nets; computational complexity; telecommunication network routing; tree searching; computational effort minimization; computational performance; depth-first search method; large-scale communication network; localization; multidestination routing algorithm; recursive Hopfield neural network; screening procedure; Bandwidth; Communication networks; Computer networks; Costs; Hopfield neural networks; Large-scale systems; Neural networks; Routing; Search methods; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Neural Networks Proceedings, 1998. IEEE World Congress on Computational Intelligence. The 1998 IEEE International Joint Conference on

Conference_Location

Anchorage, AK

ISSN

1098-7576

Print_ISBN

0-7803-4859-1

Type

conf

DOI

10.1109/IJCNN.1998.686030

Filename

686030