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!
cited_by
cites
container_end_page 128
container_issue
container_start_page 122
container_title
container_volume
creator Jijun Cao
Jing Xie
Feng Chen
description 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.
doi_str_mv 10.1109/FCST.2010.19
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5577305</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5577305</ieee_id><sourcerecordid>5577305</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-6b2c484106ba7f08d3a66d96c04e9ae897e7827b290bfa6765f2ccb44b66a4b83</originalsourceid><addsrcrecordid>eNotjDtPwzAYRS1BJUrJxsbiP-Dy-RE_2KKEUqQihmaP7NRpjdKmcpyh_55WMF3de44uQs8UlpSCeV2V23rJ4FbNHcqM0lQwIZRSht6jOaO5IZIDnaHHm2WYltQ8oGwcfwCA06sn-Bw11bYi1RsucBXGFIObkt_hot8PMaTDEXdDxOVwuqKpTeG0x-uwP5Btsi70IV1wcT73obUpDCeysRcf8dfUp-syJlxH75_QrLP96LP_XKB69V6Xa7L5_vgsiw0JBhKRjrVCCwrSWdWB3nEr5c7IFoQ31mujvNJMOWbAdVYqmXesbZ0QTkornOYL9PJ3G7z3zTmGo42XJs-V4pDzXxZyVcQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>DSD-D: A Distributed Algorithm for Constructing High-Stability Application-Layer Multicast Tree</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Jijun Cao ; Jing Xie ; Feng Chen</creator><creatorcontrib>Jijun Cao ; Jing Xie ; Feng Chen</creatorcontrib><description>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.</description><identifier>ISSN: 2159-6301</identifier><identifier>ISBN: 9781424477791</identifier><identifier>ISBN: 1424477794</identifier><identifier>DOI: 10.1109/FCST.2010.19</identifier><identifier>LCCN: 2010928619</identifier><language>eng</language><publisher>IEEE</publisher><subject>Application-Layer Multicast ; Bandwidth ; Delay ; Heuristic algorithms ; high stability ; IP networks ; multicast tree constrcting algorithm ; Pediatrics ; Stability analysis ; Time domain analysis</subject><ispartof>2010 Fifth International Conference on Frontier of Computer Science and Technology, 2010, p.122-128</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5577305$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>310,311,786,790,795,796,2071,27958,54906,55271,55283</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5577305$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Jijun Cao</creatorcontrib><creatorcontrib>Jing Xie</creatorcontrib><creatorcontrib>Feng Chen</creatorcontrib><title>DSD-D: A Distributed Algorithm for Constructing High-Stability Application-Layer Multicast Tree</title><title>2010 Fifth International Conference on Frontier of Computer Science and Technology</title><addtitle>FCST</addtitle><description>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.</description><subject>Application-Layer Multicast</subject><subject>Bandwidth</subject><subject>Delay</subject><subject>Heuristic algorithms</subject><subject>high stability</subject><subject>IP networks</subject><subject>multicast tree constrcting algorithm</subject><subject>Pediatrics</subject><subject>Stability analysis</subject><subject>Time domain analysis</subject><issn>2159-6301</issn><isbn>9781424477791</isbn><isbn>1424477794</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjDtPwzAYRS1BJUrJxsbiP-Dy-RE_2KKEUqQihmaP7NRpjdKmcpyh_55WMF3de44uQs8UlpSCeV2V23rJ4FbNHcqM0lQwIZRSht6jOaO5IZIDnaHHm2WYltQ8oGwcfwCA06sn-Bw11bYi1RsucBXGFIObkt_hot8PMaTDEXdDxOVwuqKpTeG0x-uwP5Btsi70IV1wcT73obUpDCeysRcf8dfUp-syJlxH75_QrLP96LP_XKB69V6Xa7L5_vgsiw0JBhKRjrVCCwrSWdWB3nEr5c7IFoQ31mujvNJMOWbAdVYqmXesbZ0QTkornOYL9PJ3G7z3zTmGo42XJs-V4pDzXxZyVcQ</recordid><startdate>201008</startdate><enddate>201008</enddate><creator>Jijun Cao</creator><creator>Jing Xie</creator><creator>Feng Chen</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201008</creationdate><title>DSD-D: A Distributed Algorithm for Constructing High-Stability Application-Layer Multicast Tree</title><author>Jijun Cao ; Jing Xie ; Feng Chen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-6b2c484106ba7f08d3a66d96c04e9ae897e7827b290bfa6765f2ccb44b66a4b83</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Application-Layer Multicast</topic><topic>Bandwidth</topic><topic>Delay</topic><topic>Heuristic algorithms</topic><topic>high stability</topic><topic>IP networks</topic><topic>multicast tree constrcting algorithm</topic><topic>Pediatrics</topic><topic>Stability analysis</topic><topic>Time domain analysis</topic><toplevel>online_resources</toplevel><creatorcontrib>Jijun Cao</creatorcontrib><creatorcontrib>Jing Xie</creatorcontrib><creatorcontrib>Feng Chen</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jijun Cao</au><au>Jing Xie</au><au>Feng Chen</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>DSD-D: A Distributed Algorithm for Constructing High-Stability Application-Layer Multicast Tree</atitle><btitle>2010 Fifth International Conference on Frontier of Computer Science and Technology</btitle><stitle>FCST</stitle><date>2010-08</date><risdate>2010</risdate><spage>122</spage><epage>128</epage><pages>122-128</pages><issn>2159-6301</issn><isbn>9781424477791</isbn><isbn>1424477794</isbn><abstract>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.</abstract><pub>IEEE</pub><doi>10.1109/FCST.2010.19</doi><tpages>7</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2159-6301
ispartof 2010 Fifth International Conference on Frontier of Computer Science and Technology, 2010, p.122-128
issn 2159-6301
language eng
recordid cdi_ieee_primary_5577305
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Application-Layer Multicast
Bandwidth
Delay
Heuristic algorithms
high stability
IP networks
multicast tree constrcting algorithm
Pediatrics
Stability analysis
Time domain analysis
title DSD-D: A Distributed Algorithm for Constructing High-Stability Application-Layer Multicast Tree
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-30T18%3A31%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=DSD-D:%20A%20Distributed%20Algorithm%20for%20Constructing%20High-Stability%20Application-Layer%20Multicast%20Tree&rft.btitle=2010%20Fifth%20International%20Conference%20on%20Frontier%20of%20Computer%20Science%20and%20Technology&rft.au=Jijun%20Cao&rft.date=2010-08&rft.spage=122&rft.epage=128&rft.pages=122-128&rft.issn=2159-6301&rft.isbn=9781424477791&rft.isbn_list=1424477794&rft_id=info:doi/10.1109/FCST.2010.19&rft_dat=%3Cieee_6IE%3E5577305%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i90t-6b2c484106ba7f08d3a66d96c04e9ae897e7827b290bfa6765f2ccb44b66a4b83%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5577305&rfr_iscdi=true