For the given delay-constrained multicast request, the goal of delay-constrained survivable multicast routing problem (DCSMRP) is to provide the primary multicast tree and protecting resources so that after recovering from the link (node -failure, the recovered tree canode -failure delay constheint.
At the same time, the simulation uses the rates of multicast request which are 10%, 30%, and 50% of the service requests for 100 live multimedia contents.
In some networks, if the MI nodes are destinations of the multicast request, they can drop a small fraction of the incoming signal's power locally and transmit the rest to the next node.
The performance for the proposed mechanism enhanced about 10%to46%6% for the number of channels required and about 7%to47%7% for the delay according to the rates of multicast request and service request.
We chose the number of destinations in each multicast request D=5, which seems to be reasonable as the total number of nodes in the used topologies is less than 16.
Figure 11 Comparison of the average computation time CT for setting up a multicast request using the COST-239 network.
The number of necessary channels using the proposed mechanism according to the multicast request ratios 50%, 30%, and 10% when the service request rate is 40 requests/min is decreased to 44%, 28%, and 12%, respectively.
To assess the speed of our proposed algorithm, we looked at the average computation time CT for setting up a multicast request.
Let us consider a multicast request and its corresponding light tree T. The light tree is constructed using the PIM-SSM [1] multicast routing protocol.
Then, by dividing a light-tree to some sub-light-trees and grooming the request to these sub-light-trees, the light-tree sharing ratios of multicast requests can be improved.
