Subscribe

Issue No.01 - January (2009 vol.58)

pp: 82-89

Wen Liu , Nanyang Technological University, Singapore

Lipo Wang , Nanyang Technological University, Singapore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.127

ABSTRACT

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.

INDEX TERMS

Neural nets, Multicast

CITATION

Wen Liu, Lipo Wang, "Delay-Constrained Multicast Routing Using the Noisy Chaotic Neural Networks",

*IEEE Transactions on Computers*, vol.58, no. 1, pp. 82-89, January 2009, doi:10.1109/TC.2008.127REFERENCES