DocumentCode :
2556765
Title :
Construction problem of ALM tree with pre-defined out degree
Author :
Shan, Gao ; Ping, Han ; Jun, Wang
Author_Institution :
Sch. of Comput. Sci. & Technol., Wuhan Univ. of Technol., Wuhan, China
fYear :
2010
fDate :
16-18 April 2010
Firstpage :
110
Lastpage :
113
Abstract :
Application Layer Multicast (ALM) has resolved the issue of deployment, but effectiveness inferiors to IP multicast. To build a high efficient multicast tree, this research focuses on the distributed spanning tree algorithm by using nearest physical topology node selection strategy, which is based on a new group communication model named MixCast. The average delay and average join time of the tree are analyzed. Simulation experiments prove that real physical network are considered in this strategy, so it has high data transmission efficiency.
Keywords :
IP networks; data communication; multicast communication; telecommunication network topology; ALM tree; IP multicast; MixCast; application layer multicast; average delay; distributed spanning tree algorithm; group communication model; high data transmission efficiency; nearest physical topology node selection strategy; Computer science; Delay effects; Educational institutions; Information science; Multicast algorithms; Multicast communication; Multicast protocols; Network topology; Telecommunications; Waste materials; Computer Network; Forwarding Tree Construction; Multicast;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Management and Engineering (ICIME), 2010 The 2nd IEEE International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4244-5263-7
Electronic_ISBN :
978-1-4244-5265-1
Type :
conf
DOI :
10.1109/ICIME.2010.5478199
Filename :
5478199
Link To Document :
بازگشت