Several protection schemes have been proposed in the literature to protect the
multicast connections. The simplest idea to protect the
multicast tree from single fiber failure is to compute a link disjoint backup tree. In a link disjoint backup tree, a multicast session from source node F to destination nodes A, B, C, D and E forms a light tree. F is the root and the remaining nodes are the leaves. The primary light tree is shown in solid lines and (directed-link-disjoint) the back up light tree is shown in dotted lines carrying traffic from source node to destinations. The
segment protection scheme is another way to protect
multicast connections. A segment in a
multicast tree is defined as the sequence of edges from the source or any splitting node (on a tree) to a leaf node or to a downstream splitting node. A destination node is always considered as a segment end node because it is either a leaf node in a tree or a splitting node. A multicast protection scheme through spanning paths is also one of the key approaches to protecting
multicast sessions. A spanning path in a multicast tree is defined as a path from a leaf node to any other leaf node in the light tree. The scheme derives backup paths for every spanning path in the multicast tree. == Concept of DBPP and SBPP on multicast connections ==