An efficient distributed algorithm for constructing delay- and degree-bounded application-level multicast tree
Feng Liu, J. Huang, Xicheng Lu, Yuxing Peng · 2005
In this paper we investigate the problem of finding a delay- and degree-bounded maximum sum of nodes application level multicast tree. We then proved the problem is NP-hard, and its relationship with the well-studied degree-bounded minimum maximum-delay multicast tree problem. We propose a distributed algorithm - OverStream, which adopts PPAF heuristic for father node to choose optimal child nodes based on multiple network parameters. Simulation results show that our algorithm is better than OMNI, SpreadIt, HMTP, and Zigzag in general.