By Topic

A Delivery Tree Building Approach for Application Layer Multicast

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xinchang Zhang ; Comput. Network Inf. Center & Grad. Univ., Chinese Acad. of Sci., Beijing, China ; Xiaodong Li ; Zheng Wang ; Baoping Yan

Many proposed solutions employ distributed depth-first-searching (DFS) approach to implement positioning in application layer multicast. In DFS-based delivery tree building approaches, the newcomer need not know the information of other members except the root, and positioning can be easily implemented. However, the DFS approach cannot effectively position a host in some cases because it usually selects a branch of active candidate parent to continue the searching procedure. This paper proposes a closest-first-searching (CFS) positioning means, and a CFS-based tree building approach name CFTB. In CFTB, the new active candidate parent is selected among all the candidate parents in terms of the known distance information. The simulation results show that CFTB can position a newcomer accurately, and build a multicast tree with good delivery performance.

Published in:

Computer Science and Computational Technology, 2008. ISCSCT '08. International Symposium on  (Volume:1 )

Date of Conference:

20-22 Dec. 2008