Delay-Constrained Multicast Routing Using the Noisy Chaotic Neural Networks

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 neu...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. 58; no. 1; pp. 82 - 89
Main Authors Wang, Lipo, Liu, Wen, Shi, Haixiang
Format Journal Article
LanguageEnglish
Published New York IEEE 01.01.2009
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Artificial neural networks
Chaos theory
Chaotic communication
Communication networks
Computer networks
Delay
Multicast
Neural nets
Neural networks
Neurons
Noise
Optimization
Routing
Routing (telecommunications)
Trees
Multicast
Neural nets
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2008.127