The so-called reduced multicast tree algorithm is based on the backup multicast tree algorithm and can calculate a tree from the default multicast tree by removing a particular node and by replacing the links of the removed node.
First, we introduce the so-called backup multicast tree algorithm to compute a set of n − 1 backup multicast delivery trees from the default multicast tree.
Each backup multicast tree has exactly one link of the default multicast tree that is replaced by a backup link from the set of available links.
However, unlike the multicast tree in IP Multicast which is constructed on routers, the multicast tree in ALM is composed of host receivers.
Receiver cheating may transform the multicast tree, and lead to its instability.
SCAN has four components: object location, replica placement and update multicast tree construction, replica management, and overlay network monitoring services.
Furthermore, exploiting the fundamental property of a multicast tree, namely, the observation that the multicast tree is a degraded channel, we propose an elegant application level architecture for efficient video multicast.
In SPT scheme, a given multicast session is first provisioned as a primary multicast tree, and then each segment on the primary tree is protected by a multicast tree instead of a path, as in most existing approaches.
The central and distributed implementation of the multiple multicast tree is discussed for the deployment in the real IP network.
The joining router will join the multicast tree by following these links on each router until it reaches the tree.
Backup parent pools are selected during the process of multicast tree construction based on information provided by the hierarchical clusters.
