Critical analysis of hopfield's neural network model and heuristic algorithm for shortest path computation for routing in computer networks
Loading...
Date
2012
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Abstract
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.
Description
Keywords
Electrical Engineering, Applied Sciences, Shortest Path Computation
Citation
Proceedings of 2012 9th International Bhurban Conference on Applied Sciences & Technology (IBCAST) Islamabad, Pakistan, 9th - 12th January, 2012