Conference paper
Using the Hopfield model with mean field annealing to solve the routing problem in packet-switched communication networks
1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century, Vol.4, pp.2966-2970
1995 IEEE International Conference on Systems, Man and Cybernetics (Vancouver, Canada, 22/10/1995–25/10/1995)
1995
Abstract
The performance of the Hopfield neural network with mean field annealing for finding optimal or near-optimal solutions to the routing problem problem in a communication network is investigated. The proposed neural network uses mean field annealing to eliminate the constraint terms in the energy function. Unlike other systems which use penalty constraint terms there is no need to tune constraint parameters (this tuning has been found to be difficult and problem specific) and the neural network should avoid the problems of scaling. It also avoids the need to pre-determine the minimum number of hops corresponding to the optimal route. We have obtained very encouraging simulation results for the nine node grid network and fourteen node NFSNET-backbone network.
Details
- Title
- Using the Hopfield model with mean field annealing to solve the routing problem 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
- 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century, Vol.4, pp.2966-2970
- Conference
- 1995 IEEE International Conference on Systems, Man and Cybernetics (Vancouver, Canada, 22/10/1995–25/10/1995)
- Identifiers
- 991005542077207891
- Murdoch Affiliation
- School of Mathematical and Physical Sciences
- Language
- English
- Resource Type
- Conference paper
Metrics
192 File views/ downloads
69 Record Views