
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Lipo Wang, Wen Liu, Haixiang Shi, "DelayConstrained Multicast Routing Using the Noisy Chaotic Neural Networks," IEEE Transactions on Computers, vol. 58, no. 1, pp. 8289, January, 2009.  
BibTex  x  
@article{ 10.1109/TC.2008.127, author = {Lipo Wang and Wen Liu and Haixiang Shi}, title = {DelayConstrained Multicast Routing Using the Noisy Chaotic Neural Networks}, journal ={IEEE Transactions on Computers}, volume = {58}, number = {1}, issn = {00189340}, year = {2009}, pages = {8289}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2008.127}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  DelayConstrained Multicast Routing Using the Noisy Chaotic Neural Networks IS  1 SN  00189340 SP82 EP89 EPD  8289 A1  Lipo Wang, A1  Wen Liu, A1  Haixiang Shi, PY  2009 KW  Neural nets KW  Multicast VL  58 JA  IEEE Transactions on Computers ER   
[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. 278290, Sept. 1999.
[2] T. Korkmaz and M. Krunz, “Routing Multimedia Traffic with QoS Guarantees,” IEEE Trans. Multimedia, vol. 5, no. 3, pp. 429443, Sept. 2003.
[3] A. Ganjam and H. Zhang, “Internet Multicast Video Delivery,” Proc. IEEE, vol. 93, no. 1, pp. 159170, 2005.
[4] K.M.F. Elsayed, “A Framework for EndtoEnd DeterministicDelay Service Provisioning in Multiservice Packet Networks,” IEEE Trans. Multimedia, vol. 7, no. 3, pp. 563571, 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. 2236, 2000.
[6] M. Charikar, J.S. Naor, and B. Schieber, “Resource Optimization in QoS Multicast Routing of RealTime Multimedia,” IEEE Trans. Networking, vol. 12, no. 2, pp. 340348, Apr. 2004.
[7] V. Sarangan, D. Ghosh, and R. Acharya, “CapacityAware State Aggregation for Interdomain QoS Routing,” IEEE Trans. Multimedia, vol. 8, no. 4, pp. 792808, Aug. 2006.
[8] D. Ghosh, V. Sarangan, and R. Acharya, “QualityofService Routing in IP Networks,” IEEE Trans. Multimedia, vol. 3, no. 2, pp.200208, 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. 581588, 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. 826832, 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. 321335, 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. 286292, June 1993.
[13] H.F. Salama, D.S. Reeves, and Y. Viniotis, “Evaluation of Multicast Routing Algorithms for RealTime Communication on HighSpeed Networks,” IEEE J. Selected Areas in Comm., vol. 15, no. 3, pp. 332345, 1997.
[14] R. Widyono, “The Design and Evaluation of Routing Algorithms for RealTime Channels,” Technical Report 94024, Univ. of California, Berkeley, and Int'l Computer Science Inst., June 1994.
[15] Q. Sun and H. Langendoerfer, “Efficient Multicast Routing for DelaySensitive Applications,” Proc. Second Workshop Protocols Multimedia Systems (PROMS '95), pp. 452458, 1995.
[16] Q. Zhu, M. Parsa, and J.J. GarciaLunaAceves, “A SourceBased Algorithm for NearOptimum DelayConstrained Multicasting,” Proc. IEEE INFOCOM '95, pp. 377385, 1995.
[17] M. Parsa, Q. Zhu, and J.J. GarciaLunaAceves, “An Iterative Algorithm for DelayConstrained MinimumCost Multicasting,” IEEE Trans. Networking, vol. 6, no. 4, pp. 461474, 1998.
[18] J.Y. Yen, “Finding the K Shortest Loopless Paths in a Network,” Management Science, vol. 17, no. 11, pp. 712716, 1971.
[19] P. Manyem, “Routing Problems in Multicast Network,” PhD dissertation, North Carolina State Univ., Raleigh, chapter 3, pp.2839, 1996.
[20] H.E. Rauch and T. Winarske, “Neural Networks for Routing Communication Traffic,” IEEE Control Systems Magazine, vol. 8, no. 2, pp. 2631, 1988.
[21] J.J. Hopfield, “Neural Networks and Physical Systems with Emergent Collective Computational Abilities,” Proc. Nat'l Academy of Sciences, vol. 79, pp. 25542558, 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. 280282, 1995.
[23] H. Nozawa, “A NeuralNetwork Model as a Globally Coupled Map and Applications Based on Chaos,” Chaos, vol. 2, no. 3, pp.377386, 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. 915930, 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. 10071020, 2002.
[26] X. Xu, Z. Tang, and J. Wang, “A Method to Improve the Transiently Chaotic Neural Network,” Neurocomputing, vol. 67, pp. 456463, 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. 3740, 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. 21192125, 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. 941954, 1993.
[30] D.C. Park and S.E. Choi, “A Neural Network Based MultiDestination Routing Algorithm for Communication Network,” Proc. IEEE Int'l Joint Conf. Neural Networks (IJCNN '98), pp.16731678, 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. 11761178, 2001.
[32] C. Pornavalai, G. Chakraborty, and N. Shiratori, “A Neural Network Approach to Multicast Routing in RealTime Communication Networks,” Proc. Int'l Conf. Network Protocols (ICNP '95), pp. 332339, 1995.
[33] K. Aihara, “Chaos Engineering and Its Application to Parallel Distributed Processing with Chaotic Neural Networks,” Proc. IEEE, vol. 90, no. 5, pp. 919930, 2002.
[34] M. DelgadoRestituto and A. RodriguezVazquez, “Integrated Chaos Generators,” Proc. IEEE, vol. 90, no. 5, pp. 747767, 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. 419, 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. 213217, 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. 12891298, 2002.
[38] B. Waxman, “Routing of Multipoint Connections,” IEEE J. Selected Areas in Comm., vol. 6, no. 9, pp. 16171622, 1988.