This Article 
 Bibliographic References 
 Add to: 
Delay-Constrained Multicast Routing Using the Noisy Chaotic Neural Networks
January 2009 (vol. 58 no. 1)
pp. 82-89
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.

[1] R.-S. Chang and C.-D. Wang, “Improved WWW Multimedia Transmission Performance in HTTP/TCP over ATM Networks,” IEEE Trans. Multimedia, vol. 1, no. 3, pp. 278-290, Sept. 1999.
[2] T. Korkmaz and M. Krunz, “Routing Multimedia Traffic with QoS Guarantees,” IEEE Trans. Multimedia, vol. 5, no. 3, pp. 429-443, Sept. 2003.
[3] A. Ganjam and H. Zhang, “Internet Multicast Video Delivery,” Proc. IEEE, vol. 93, no. 1, pp. 159-170, 2005.
[4] K.M.F. Elsayed, “A Framework for End-to-End Deterministic-Delay Service Provisioning in Multiservice Packet Networks,” IEEE Trans. Multimedia, vol. 7, no. 3, pp. 563-571, 2005.
[5] B. Wang and C.J. Hou, “A Survey on Multicast Routing and Its QoS Extension: Problems, Algorithms, and Protocols,” IEEE Network Magazine, vol. 14, no. 1, pp. 22-36, 2000.
[6] M. Charikar, J.S. Naor, and B. Schieber, “Resource Optimization in QoS Multicast Routing of Real-Time Multimedia,” IEEE Trans. Networking, vol. 12, no. 2, pp. 340-348, Apr. 2004.
[7] V. Sarangan, D. Ghosh, and R. Acharya, “Capacity-Aware State Aggregation for Interdomain QoS Routing,” IEEE Trans. Multimedia, vol. 8, no. 4, pp. 792-808, Aug. 2006.
[8] D. Ghosh, V. Sarangan, and R. Acharya, “Quality-of-Service Routing in IP Networks,” IEEE Trans. Multimedia, vol. 3, no. 2, pp.200-208, June 2001.
[9] C.P. Low and X.Y. Song, “On Finding Feasible Solutions for the Delay Constrained Group Multicast Routing Problem,” IEEE Trans. Computers, vol. 51, no. 5, pp. 581-588, May 2002.
[10] H.Y. Tyan, J.C. Hou, and B. Wang, “Many to Many Multicast Routing with Temporal Quality of Service Guarantees,” IEEE Trans. Computers, vol. 52, no. 6, pp. 826-832, June 2003.
[11] D. Chakraborty, G. Chakraborty, and N. Shiratori, “A Dynamic Multicast Routing Satisfying Multiple QoS Constraints,” Int'l J. Network Management, vol. 13, no. 5, pp. 321-335, 2003.
[12] V.P. Kompella, J.C. Pasquale, and G.C. Polyzos, “Multicast Routing for Multimedia Communication,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 286-292, June 1993.
[13] H.F. Salama, D.S. Reeves, and Y. Viniotis, “Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks,” IEEE J. Selected Areas in Comm., vol. 15, no. 3, pp. 332-345, 1997.
[14] R. Widyono, “The Design and Evaluation of Routing Algorithms for Real-Time Channels,” Technical Report 94-024, Univ. of California, Berkeley, and Int'l Computer Science Inst., June 1994.
[15] Q. Sun and H. Langendoerfer, “Efficient Multicast Routing for Delay-Sensitive Applications,” Proc. Second Workshop Protocols Multimedia Systems (PROMS '95), pp. 452-458, 1995.
[16] Q. Zhu, M. Parsa, and J.J. Garcia-Luna-Aceves, “A Source-Based Algorithm for Near-Optimum Delay-Constrained Multicasting,” Proc. IEEE INFOCOM '95, pp. 377-385, 1995.
[17] M. Parsa, Q. Zhu, and J.J. Garcia-Luna-Aceves, “An Iterative Algorithm for Delay-Constrained Minimum-Cost Multicasting,” IEEE Trans. Networking, vol. 6, no. 4, pp. 461-474, 1998.
[18] J.Y. Yen, “Finding the K Shortest Loopless Paths in a Network,” Management Science, vol. 17, no. 11, pp. 712-716, 1971.
[19] P. Manyem, “Routing Problems in Multicast Network,” PhD dissertation, North Carolina State Univ., Raleigh, chapter 3, pp.28-39, 1996.
[20] H.E. Rauch and T. Winarske, “Neural Networks for Routing Communication Traffic,” IEEE Control Systems Magazine, vol. 8, no. 2, pp. 26-31, 1988.
[21] J.J. Hopfield, “Neural Networks and Physical Systems with Emergent Collective Computational Abilities,” Proc. Nat'l Academy of Sciences, vol. 79, pp. 2554-2558, 1982.
[22] A.H. Gee and R.W. Prager, “Limitations of Neural Networks for Solving Traveling Salesman Problems,” IEEE Trans. Neural Networks, vol. 6, no. 1, pp. 280-282, 1995.
[23] H. Nozawa, “A Neural-Network Model as a Globally Coupled Map and Applications Based on Chaos,” Chaos, vol. 2, no. 3, pp.377-386, 1992.
[24] L.N. Chen and K. Aihara, “Chaotic Simulated Annealing by a Neural Network Model with Transient Chaos,” Neural Networks, vol. 8, no. 6, pp. 915-930, 1995.
[25] Z. Ding, H. Leung, and Z. Zhu, “A Study of the Transiently Chaotic Neural Network for Combinatorial Optimization,” Math. and Computer Modelling, vol. 36, no. 9, pp. 1007-1020, 2002.
[26] X. Xu, Z. Tang, and J. Wang, “A Method to Improve the Transiently Chaotic Neural Network,” Neurocomputing, vol. 67, pp. 456-463, Mar. 2005.
[27] L.P. Wang and F.Y. Tian, “Noisy Chaotic Neural Networks for Solving Combinatorial Optimization Problems,” Proc. Int'l Joint Conf. Neural Networks (IJCNN '00), vol. 4, pp. 37-40, July 2000.
[28] L.P. Wang, S. Li, F.Y. Tian, and X.J. Fu, “A Noisy Chaotic Neural Network for Solving Combinatorial Optimization Problems: Stochastic Chaotic Simulated Annealing,” IEEE Trans. Systems, Man, and Cybernetics—Part B: Cybernetics, vol. 34, no. 5, pp. 2119-2125, 2004.
[29] M.K.M. Ali and F. Kamoun, “Neural Networks for Shortest Path Computation and Routing in Computer Networks,” IEEE Trans. Neural Networks, vol. 4, no. 6, pp. 941-954, 1993.
[30] D.C. Park and S.E. Choi, “A Neural Network Based Multi-Destination Routing Algorithm for Communication Network,” Proc. IEEE Int'l Joint Conf. Neural Networks (IJCNN '98), pp.1673-1678, 1998.
[31] C.W. Ahn, R.S. Ramakrishna, C.G. Kang, and I.C. Choi, “Shortest Path Routing Algorithm Using Hopfield Neural Network,” Electronics Letters, vol. 37, no. 19, pp. 1176-1178, 2001.
[32] C. Pornavalai, G. Chakraborty, and N. Shiratori, “A Neural Network Approach to Multicast Routing in Real-Time Communication Networks,” Proc. Int'l Conf. Network Protocols (ICNP '95), pp. 332-339, 1995.
[33] K. Aihara, “Chaos Engineering and Its Application to Parallel Distributed Processing with Chaotic Neural Networks,” Proc. IEEE, vol. 90, no. 5, pp. 919-930, 2002.
[34] M. Delgado-Restituto and A. Rodriguez-Vazquez, “Integrated Chaos Generators,” Proc. IEEE, vol. 90, no. 5, pp. 747-767, 2002.
[35] M. Bucolo, R. Caponetto, L. Fortuna, M. Frasca, and A. Rizzo, “Does Chaos Work Better Than Noise?” IEEE Circuits and Systems Magazine, vol. 2, no. 3, pp. 4-19, 2002.
[36] V. Pavlovic, D. Schonfeld, and G. Friedman, “Stochastic Noise Process Enhancement of Hopfield Neural Networks,” IEEE Trans. Circuits and Systems II, vol. 52, no. 4, pp. 213-217, 2005.
[37] P. Venkataram, S. Ghosal, and B.P.V. Kumar, “Neural Network Based Optimal Routing Algorithm for Communication Networks,” Neural Networks, vol. 15, no. 10, pp. 1289-1298, 2002.
[38] B. Waxman, “Routing of Multipoint Connections,” IEEE J. Selected Areas in Comm., vol. 6, no. 9, pp. 1617-1622, 1988.

Index Terms:
Neural nets, Multicast
Lipo Wang, Wen Liu, Haixiang Shi, "Delay-Constrained Multicast Routing Using the Noisy Chaotic Neural Networks," IEEE Transactions on Computers, vol. 58, no. 1, pp. 82-89, Jan. 2009, doi:10.1109/TC.2008.127
Usage of this product signifies your acceptance of the Terms of Use.