By Topic

Neural network approach for communication network routing problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Liu Rong ; Beijing Univ. of Posts & Telecommun., China ; Liu Ze-Min ; Zhou Zheng

A description of the Hopfield/Tank model used for the communication network routing problem is given. Then, through "static" (i.e. the eigenvalue and the eigenspace of the connection matrix) and the dynamic analyses of the model, it is found that the model has the fastest rate to converge to the optimal or near-optimal solutions from an initial value. Therefore the quality of the final solutions can be guaranteed. The influence of the initial value on the final solutions is also considered. Simulation results are given at the end of the paper.<>

Published in:

TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on  (Volume:3 )

Date of Conference:

19-21 Oct. 1993