A Multicast Routing Algorithm Based on Improved Annealing Mechanics in Transiently Chaotic Neural Network
Guangbin Bao, Zhanting Yuan, Jian Song, Yong Yu, Xinming Xie · 2006
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