Abstract—The multicasting is used to transfer data from one or more sources to a potentially large number of destinations such that overall utilization of resources is minimized in some sense. An approach based on neural network is presented to solve the delay constraint multicast routing problem, which is a NP complete problem,. The multicast tree is obtained corresponding to optimum (minimum) routing cost subjected to end-to-end delay constraints. The multicast tree is obtained by recursively obtaining the delay bound shortest paths from source to various destinations and combining them by union operator to ensure that a link is appearing only once in the multicast tree. The effectiveness of the developed algorithm is tested to obtain optimum multicast trees for different sets of source and destinations on 14-node weighted connected network.
Index Terms—Multicast Routing, Neural Network, Hopfield Neural Network, Steiner Tree, Routing Algorithm.
Sushma Jain is with Computer Science & Engineering Department, Thapar University, Patiala, India-147004, (e-mail: sjain@thapar.edu).
J. D. Sharma is with Electrical Engineering Department, Indian Institute of Technology, Roorkee, India-247667, (e-mail: jaydsfee@iitr.ernet.in).
Cite: Sushma Jain and J. D. Sharma, "Delay Bound Multicast Routing Using Hopfield Neural Network," International Journal of Computer Theory and Engineering vol. 2, no. 3, pp. 384-389, 2010.
Copyright © 2008-2024. International Association of Computer Science and Information Technology. All rights reserved.
