Procedure for multicast tree maintenance based on member time duration
Kais Mnif, Michel Kadoch · 2005
In this paper we propose a new maintenance procedure for dynamic multicasting. With this procedure, we can guarantee that we add/delete a node to the existing tree without the need to rebuild the entire tree. Our approach finds the best route for a new member taking into consideration the time duration of each member in the group. Simulations results show that tree cost is very close to other algorithm that does not consider the dynamic of members in the group