Issue No. 01 - January (2009 vol. 58)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.127
Lipo Wang , Nanyang Technological University, Singapore
Wen Liu , Nanyang Technological University, Singapore
Haixiang Shi , Nanyang Technological University, Singapore
We present a method to compute the delay constrained multicast routing tree by employing chaotic neural networks. Experimental result shows that the noisy chaotic neural network (NCNN) provides optimal solution more often compared to the transiently chaotic neural network (TCNN) and the Hopfield neural network (HNN). Furthermore, compared with the bounded shortest multicast algorithm (BSMA), the noisy chaotic neural network is able to find multicast trees with lower cost.
Neural nets, Multicast
W. Liu, H. Shi and L. Wang, "Delay-Constrained Multicast Routing Using the Noisy Chaotic Neural Networks," in IEEE Transactions on Computers, vol. 58, no. , pp. 82-89, 2008.