By Topic

Neural network implementation of the shortest path algorithm for traffic routing in communication networks

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
$31 $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

2 Author(s)
Zhang, L. ; Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA ; Thomopoulos, S.C.A.

Summary form only given, as follows. A neural network computation algorithm is introduced to solve 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 (e.g. expected delay). Unlike the algorithm introduced earlier in this area, the knowledge about the number of links (hops) between each origin-destination pair is not required by the algorithm, therefore it can be applied to a more general network. The neural network structure for implementing the algorithm is a modification of the one used by the traveling salesman algorithm. Computer simulations in a nine-node grid network show that the algorithm performs well.<>

Published in:

Neural Networks, 1989. IJCNN., International Joint Conference on

Date of Conference:

0-0 1989