Applying Hopfield neural network to QoS routing in communication network

Li Wang, Jin-yuan Shen, Sheng-jiang Chang, Yan-xin Zhang

Optoelectronics Letters ›› 2005, Vol. 1 ›› Issue (3) : 217-220.

Optoelectronics Letters ›› 2005, Vol. 1 ›› Issue (3) : 217-220. DOI: 10.1007/BF03033847
Image and Information Processing

Applying Hopfield neural network to QoS routing in communication network

Author information +
History +

Abstract

The main goal of routing solutions is to satisfy the requirements of the Quality of Service (QoS) for every admitted connection as well as to achieve a global efficiency in resource utilization. In this paper proposes a solution based on Hopfield neural network (HNN) to deal with one of representative routing problems in uni-cast routing, i. e. the multi-constrained (MC) routing problem. Computer simulation shows that we can obtain the optimal path very rapidly with our new Lyapunov energy functions.

Cite this article

Download citation ▾
Li Wang, Jin-yuan Shen, Sheng-jiang Chang, Yan-xin Zhang. Applying Hopfield neural network to QoS routing in communication network. Optoelectronics Letters, 2005, 1(3): 217‒220 https://doi.org/10.1007/BF03033847

References

[1]
ChenS., NahrstedtK.. IEEE Network, 1998, 12: 84-84
[2]
HaykinSimon. Neural Networks,A comprehensive Foundation, 2001, Second EditionBeijing, Tsinghua University Press, 2-2
[3]
SmithA. Kate. INFORMS Journal on Computing, 1999, 11: 15-15
CrossRef Google scholar
[4]
WangJ. IEEE Trans Circuits Syst I: Fundamental Theory Application, 1996, 43: 482-482
CrossRef Google scholar
[5]
L. Zhang and S. C. A. Thompoulos,Proc. Int. Joint Conf. Neural Networks, June 1989, II 591.
[6]
Mehmet AliMustafa K., KamounFacuzi. IEEE Trans Neural Networks, 1993, 4: 941-941
CrossRef Google scholar
[7]
AraujoF., RibeiroB., RodriguesL.. IEEE Transactions on, 2001, 12: 1067-1067
[8]
GEEA. H.. Problem Solving with Optimization Networks, 1993, Cambridge, U. K., Queen’s College, Cambridge University
[9]
G. Feng,Neural Network and Algorithmic Methods for Solving Routing Problems in High Speed Networks, Ph. D. thesis, University of Miami, December 2001.
[10]
S. Chen and K. Nahrstedt,On Finding Multi-Constrained Paths. IEEE ICC98, June 1998.
[11]
Turgay Korkmaz and Marwan Krunz,Multi-Constrained Optimal Path Selection, INFOCOM2001,. Alaska, 2001, 834–843.

Accesses

Citations

Detail

Sections
Recommended

/