By Topic

DSD-D: A Distributed Algorithm for Constructing High-Stability Application-Layer Multicast Tree

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

3 Author(s)
Jijun Cao ; Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China ; Jing Xie ; Feng Chen

In Application-Layer Multicast (ALM) tree, when a parent node leaves, all its descendent nodes must adjust their positions resulting in the interruption of multicast connections. This is called stability problem of ALM trees which may degrade the continuity of multicast data transmission. In this paper, we analyze the stability problem of ALM trees and propose the Instantaneous Stability Degree Model (ISDM). An approach that takes advantage of the statistical properties of member's join-leave behavior is proposed to estimate the Relative Leave Probabilities of ALM nodes. Furthermore, this paper proposes the Degree-bounded maximum instantaneous Stability Degree spanning tree problem (DSD) based on the ISDM. The DSD problem is proved to be NP-hard and a distributed algorithm, namely DSD-D, is proposed to solve it. Finally, the simulation results show that the algorithm works better than the Minimum-Depth, Longest-First, Relaxed BO, Relaxed TO and ROST algorithm in general.

Published in:

Frontier of Computer Science and Technology (FCST), 2010 Fifth International Conference on

Date of Conference:

18-22 Aug. 2010