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

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 pa...

Full description

Saved in:
Bibliographic Details
Main Authors: Jijun Cao, Jing Xie, Feng Chen
Format: Conference Proceeding
Language:English
Subjects:
Application-Layer Multicast
Bandwidth
Delay
Heuristic algorithms
high stability
IP networks
multicast tree constrcting algorithm
Pediatrics
Stability analysis
Time domain analysis
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2159-6301
DOI:10.1109/FCST.2010.19