By Topic

Critical analysis of hopfield's neural network model and heuristic algorithm for shortest path computation for routing in computer 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)
Sarwar, F. ; Univ. of Manage. & Technol., Lahore, Pakistan ; Bhatti, A.A.

Shortest path routing and its computation is a crucial point in computer networks, and has significant impact on overall network's performance. Being an issue of salient importance, many algorithms were proposed for shortest path computation and are still under research for more enhancements. Hopfield proposed a neural network based architecture for such optimization problems. Mehmet and Park Keum suggested improved energy functions for this neural network to implement it for routing in computer networks. A* search algorithm is a heuristic based approach, with the properties of Dijikstra algorithm and is used for same purpose. Performances of both approaches are compared and results are analyzed.

Published in:

Applied Sciences and Technology (IBCAST), 2012 9th International Bhurban Conference on

Date of Conference:

9-12 Jan. 2012