Multicast tree construction: a nodes' relative leaving probability algorithm based on NICE in ALM
by Jianqun Cui; Kuan Gao; YongJia Ye; Jing Fan; Libing Wu; Yi Yang
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 9, No. 1/2, 2016

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.

Online publication date: Sat, 19-Mar-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email