DocumentCode
3443343
Title
Constructing a Degree-Constrained Low Delay Application Layer Multicast Tree
Author
Chen, Tan ; Shan, Baosong ; Xiong, Xin
Author_Institution
State Key Lab. of Software Dev. Environ., Beijing Univ. of Aeronaut. & Astronaut., Beijing
fYear
2008
fDate
12-14 Oct. 2008
Firstpage
1
Lastpage
4
Abstract
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.
Keywords
Internet; communication complexity; multicast communication; optimisation; protocols; telecommunication network topology; trees (mathematics); Internet; NP-hard; degree-constrained minimum delay application layer multicast tree; delay sensitive applications; delivery tree; distributed protocol; group communication; optimization problem; overlay network; physical network topology; proximity aware technique; Aerospace industry; Application software; Buildings; Computer science; Delay; Large-scale systems; Network topology; Optimization methods; Peer to peer computing; Programming;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on
Conference_Location
Dalian
Print_ISBN
978-1-4244-2107-7
Electronic_ISBN
978-1-4244-2108-4
Type
conf
DOI
10.1109/WiCom.2008.1015
Filename
4678923
Link To Document