Using the Hopfield model with mean field annealing to solve the routing problem in packet-switched communication networks
Dixon, M.W., Cole, G.R. and Bellgard, M.I. (1995) Using the Hopfield model with mean field annealing to solve the routing problem in packet-switched communication networks. In: 1995 IEEE International Conference on Systems, Man and Cybernetics, 22 - 25 October 1995, Vancouver, Canada pp. 2966-2970.
*Subscription may be required
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.
|Publication Type:||Conference Paper|
|Murdoch Affiliation:||School of Mathematical and Physical Sciences|
|Item Control Page|
Downloads per month over past year