Constructing a Degree-Constrained Low Delay Application Layer Multicast Tree
Tan Chen, B. S. Shan, Xin Xiong · 2008
Application layer multicast is probably the most efficient scheme to sustain the group communication for delay sensitive applications in Internet due to its rapid deployment. However, the problem of building a degree-constrained minimum delay application layer multicast tree is proven to be NP-hard. In this paper, we investigate this optimization problem and propose a distributed protocol to explore the method of constructing distribution tree based on members' relative position in underlying network, which utilizes physical network topology information to assist the optimizing of delivery tree through employing proximity aware technique for overlay network. Evaluation results show our scheme achieves efficiency as well as may support real time applications effectively.