Title: Multicast tree construction: a nodes' relative leaving probability algorithm based on NICE in ALM
Authors: Jianqun Cui; Kuan Gao; YongJia Ye; Jing Fan; Libing Wu; Yi Yang
Addresses: School of Computer Science, Central China Normal University, Wuhan, 430079, China ' School of Computer Science, Central China Normal University, Wuhan, 430079, China ' School of Computer Science, Central China Normal University, Wuhan, 430079, China ' School of Computer Science, Wuhan University, Wuhan, 430072, China ' School of Computer Science, Wuhan University, Wuhan, 430072, China ' Math and Computer Science Department, Fontbonne University, St. Louis, MO 63105, USA
Abstract: Due to the existing defects of IP multicast, which is difficult to be expanded and managed, the researchers put forward application layer multicast. Real-time transmission is an important application field of application layer multicast technology. However, it has strict requirements for the network delay. This paper firstly analyses the delays composition of application layer multicast and the rule of the distribution of the nodes' session time. And then, according to these factors, we propose a multicast tree construction algorithm concerning the nodes' relative leaving probability based on NICE (NRLP-NICE). NRLP-NICE compares the distance among nodes and selects the centre nodes as the leaders to build new multicast tree. Meanwhile, NRLP-NICE switches the rule of the distribution of nodes' session time into nodes' relative leaving probability. NRLP-NICE is simulated by Omnet++. The simulated results show that NRLP-NICE has low control costs and average delay error percentage compared to NICE.
Keywords: application layer multicast; ALM; NICE; node relative leaving probability; multicast tree construction; simulation.
International Journal of Autonomous and Adaptive Communications Systems, 2016 Vol.9 No.1/2, pp.4 - 19
Available online: 19 Mar 2016 *Full-text access for editors Access for subscribers Purchase this article Comment on this article