Conference paper
A neural network shortest path algorithm for routing in packet-switched communication networks
Proceedings IEEE International Conference on Communications ICC '95, Vol.3, pp.1602-1606
1995 International Conference on Communications (ICC '95): Gateway to Globalization (Seattle, Washington, USA, 18/06/1995–22/06/1995)
1995
Abstract
This paper presents a Hopfield neural network that solves the routing problem in a communication network. It uses mean field annealing to eliminate the constraint terms in the energy function. Since there are no penalty parameters this approach should avoid the problems of scaling. Computer simulations of the neural network algorithm have shown that it can find optimal or near-optimal valid routes for all origin destination pairs in a fourteen node communication network.
Details
- Title
- A neural network shortest path algorithm for routing in packet-switched communication networks
- Authors/Creators
- M.W. Dixon (Author/Creator) - Murdoch UniversityG.R. Cole (Author/Creator) - Murdoch UniversityM.I. Bellgard (Author/Creator) - Murdoch University
- Publication Details
- Proceedings IEEE International Conference on Communications ICC '95, Vol.3, pp.1602-1606
- Conference
- 1995 International Conference on Communications (ICC '95): Gateway to Globalization (Seattle, Washington, USA, 18/06/1995–22/06/1995)
- Identifiers
- 991005542232207891
- Murdoch Affiliation
- School of Mathematical and Physical Sciences
- Language
- English
- Resource Type
- Conference paper
Metrics
189 File views/ downloads
112 Record Views