A Multicast Routing Algorithm Applied to HIP-Multicast Model

Secure HIP-multicast model provides the effective mechanisms of the management, authentication and authorization to group members. But it lacks an appropriate multicast routing algorithm. Here we present a new multicast routing algorithm applied to the HIP-multicast model. The new algorithm decomposes the HIP-multicast tree into a center tree and several sub-trees, and introduces the weight of the nodes and the weight ratio of the links. The results of theory and simulation show that the new algorithm overcomes the shortcomings of traditional multicast routing algorithms and can be applied to the HIP-multicast model.