CAM05-3: Multicast Tree Algorithm Minimizing the Number of Fast Reroute Protection Links for P2MP-TE Networks

Recently, the technologies of multicast multiprotocol label switching (MPLS) based on the resource reservation signaling protocol (RSVP) have been developed to achieve multicast services with high quality and reliability. In multicast MPLS based on RSVP, a high-quality broadcasting service is achieved by configuring the detour path for fast rerouting (FRR) on the multicast route, which is completely controlled. In such a network, the path management technique for setting the FRR path effectively is very important. In this paper, we propose a multicast tree algorithm for minimizing the number of links that compose the tree in order to reduce the protected facilities of FRR link protection in point-to-multipoint traffic-engineered networks. The performance of the algorithm is analyzed and compared with two traditional routing algorithms: the shortest- path tree algorithm and the minimum spanning tree algorithm. The results indicate that our algorithm can calculate a multicast tree with fewer links than the traditional algorithms. Moreover, our algorithm does not increase the total cost. It is applicable to tree calculations for applications such as digital broadcasting or group video conferencing, which maintain service reliability by FRR in the case of a failure.