Delay-constrained multicast routing using the noisy chaotic neural networks

Lipo Wang; Wen Liu; Haixiang Shi

doi:10.1109/TC.2008.127

Delay-constrained multicast routing using the noisy chaotic neural networks

Lipo Wang^*
, Wen Liu
, Haixiang Shi

^*Corresponding author for this work

Nanyang Technological University

Research output: Contribution to journal › Article › peer-review

29 Citations (Scopus)

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.

Original language	English
Pages (from-to)	82-89
Number of pages	8
Journal	IEEE Transactions on Computers
Volume	58
Issue number	1
DOIs	https://doi.org/10.1109/TC.2008.127
Publication status	Published - 2009
Externally published	Yes

Keywords

Chaos
Constrained Steiner tree (CST)
Multicast routing
Neural networks
Noise

Access to Document

10.1109/TC.2008.127

Cite this

@article{37490838f49347bb9962aa7edddc5a50,

title = "Delay-constrained multicast routing using the noisy chaotic neural networks",

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.",

keywords = "Chaos, Constrained Steiner tree (CST), Multicast routing, Neural networks, Noise",

author = "Lipo Wang and Wen Liu and Haixiang Shi",

year = "2009",

doi = "10.1109/TC.2008.127",

language = "English",

volume = "58",

pages = "82--89",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

number = "1",

}

TY - JOUR

T1 - Delay-constrained multicast routing using the noisy chaotic neural networks

AU - Wang, Lipo

AU - Liu, Wen

AU - Shi, Haixiang

PY - 2009

Y1 - 2009

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

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

KW - Chaos

KW - Constrained Steiner tree (CST)

KW - Multicast routing

KW - Neural networks

KW - Noise

UR - https://www.scopus.com/pages/publications/57349156963

U2 - 10.1109/TC.2008.127

DO - 10.1109/TC.2008.127

M3 - Article

AN - SCOPUS:57349156963

SN - 0018-9340

VL - 58

SP - 82

EP - 89

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 1

ER -

Delay-constrained multicast routing using the noisy chaotic neural networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this