Download Now Free registration required
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.
- Format: PDF
- Size: 353.1 KB