Brief Announcement: Decentralized Construction of Multicast Trees Embedded Into P2P Overlay Networks Based on Virtual Geometric Coordinates
Many of the existing multicast tree solutions are very sensitive to node departures, send many messages for constructing the tree or are not fully decentralized. In this paper the authors investigate the problem of constructing in a fully distributed manner multicast trees embedded into P2P overlays in which the nodes have virtual geometric coordinates assigned to them. They present a multicast tree construction algorithm which makes use of these coordinates in order to send a minimum number of messages. They also consider the situation in which every participating node i knows the time moment T(i) when it will leave the system and they use this information for constructing stable multicast trees.