Shortest path computation in MOSPF protocol using an annealed Hopfield neural network with a new cooling schedule

Information sciences

Volumn 129, Issue 1-4, 2000, Pages 17-30

  Lin, Jzau Sheng ^a   Liu, Mingshou ^a   Huang, Nen Fu ^b  

^a NATIONAL CHIN YI UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); MULTICASTING; MULTIMEDIA SYSTEMS; NETWORK PROTOCOLS; PACKET NETWORKS; ROUTERS; TELECOMMUNICATION TRAFFIC;

ANNEALED HOPFIELD NEURAL NETWORKS; COOLING SCHEDULE; MULTICAST OPEN SHORTEST PATH FIRST (MOSPF) PROTOCOL;

NEURAL NETWORKS;

EID: 0034318398     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(00)00071-2     Document Type: Article

References (24)

1. C. Hedrick, Routing Information Protocol, RFC 1058, Proteon, Inc., June, 1988.
2. J. Moy, OSPF version 2 RFC 1583 Proteon, Inc., 1994a.
3. J. Moy, Multicast Extensions to OSPF, RFC 1584, Proteon, Inc., 1994b.
4. Dijkstra E.W. A note on two problems in connection with graph. Numerische Mathematik. 1:1959;269-271.
5. Hopfield J.J. Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci. 79:1982;2554-2558.
6. Hopfield J.J., Tank D.W. Neural computation of decisions in optimization problems. Biol. Cybern. 52:1985;141-152.
7. Hopfield J.J., Tank D.W. Computing with neural circuits: a model. Science. 8:1986;625-633.
8. Cheng K.S., Lin J.S., Mao C.W. The application of competitive Hopfield neural network to medical image segmentation. IEEE Trans. Medical Images. 15:1996;560-567.
9. Lin J.S., Cheng K.S., Mao C.W. A fuzzy Hopfield neural network for medical image segmentation. IEEE Trans. Nucl. Sci. 43:1996;2389-2398.
10. Leung Y.W. Neural scheduling algorithms for time-multiplex switches. IEEE J. Selected Areas Commun. 12:1994;1481-1487.
11. T.X. Brown, Neural networks for switching, IEEE Commun. Mag. (1989) 72-81.
12. Lee S.L., Chang S. Neural Networks for routing of communication networks with unreliable components. IEEE Trans. Neural Networks. 4:1993;854-863.
13. Ali M.K.M., Kamoun F. Neural networks for shortest path computation and routing in computer networks. IEEE Trans. Neural Networks. 4:1993;941-954.
14. Floreen P., Orponen P. Attraction radii in binary Hopfield nets are hard to compute. Neural Comput. 5:1993;812-821.
15. Pierre S., Hyppolite M.A., Bourjolly J.M., Dioume O. Topological design of computer communication networks using simulated annealing. Eng. Appl. Artif. Intell. 8:1995;61-69.
16. Van Den Bout D.E., Miller III T.K. A traveling salesman objective function that works. Int. Conf. Neural Network. II:1988;299-303.
17. Kirkpatrick S., Gelatt C.D. Jr., Vecchi M.P. Optimization by simuted annealing. Science. 220:1983;671-680.
18. Tan H.L., Gelfand S.B., Delp E.J. A cost minimization approach to edge detection using simulated annealing. IEEE Trans. PAMI. 14:1991;3-18.
19. Jalali S., Boyce J.F. Determination of optimal general edge detectors by global minimization of a cost function. Image Vision Comput. 13:1995;683-693.
20. Klein R.W., Dubes R.C. Experiments in projection and clustering by simulated annealing. Pattern Recognition. 22:1989;213-220.
21. G. Bibro, R. Mann, T.K. Miller III, W. Snyder, D.E. Van Den Bout, M. White, Mean field annealing and neural networks, in: Advances in Neural Information Processing Systems, Morgan-Kaufmann, Los Altos, CA, 1989, pp. 91-98.
22. Van Laarhoven, Aarts E.H.L. Simulated Annealing: Theory and Applications. 1988;Kluwer Academic Publishers, Boston, MA.
23. Geman S., Geman D. Stochastic relaxation, Gibbs distributions and the Baysian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell. 6:1984;721-741.
24. Haykin S. Neural Network: a Comprehensive Foundation. 1994;Macmillan, New York.