loading...
A Multicast Routing Algorithm Based on Improved Annealing Mechanics in Transiently Chaotic Neural Network
Jinan, China October 16-October 18
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISDA.2006.2Sixth International Conference on Int ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Guangbin Bao, Lanzhou University of Technology, P.R. China
Zhanting Yuan, Lanzhou University of Technology, P.R. China
Jian Song, Lanzhou University of Technology, P.R. China
Yong Yu, Lanzhou University of Technology, P.R. China
Xinming Xie, Lanzhou University of Technology, P.R. China
Multicast routing service is becoming a key requirement of computer networks in supporting multimedia applications. And multicast routing problem has been demonstrated technically as a NP-complete. This paper analyzes the dynamic characteristics of transiently chaotic neural networks (TCNN), which quite sensitively depend on value of the self-feedback connection weights. Additionally, it proposes an improved simulated annealing mechanics for value of the self-feedback connection weights that can accelerate the search speed and guarantee the accuracy in solving combinatorial optimization problems. The result of simulation shows that the proposed algorithm has the advantage over the conventional algorithms in efficiency.
Index Terms:
Transiently chaotic neural network, Simulated annealing, Multicast Routing.
Citation:
Guangbin Bao, Zhanting Yuan, Jian Song, Yong Yu, Xinming Xie, "A Multicast Routing Algorithm Based on Improved Annealing Mechanics in Transiently Chaotic Neural Network," isda, vol. 3, pp.207-210, Sixth International Conference on Intelligent Systems Design and Applications (ISDA'06) Volume 3, 2006
Usage of this product signifies your acceptance of the Terms of Use.