{"id":"https://openalex.org/W2158909641","doi":"https://doi.org/10.1109/lcn.2010.5735701","title":"Strategies and approaches for multicast tree stability","display_name":"Strategies and approaches for multicast tree stability","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2158909641","doi":"https://doi.org/10.1109/lcn.2010.5735701","mag":"2158909641"},"language":"en","primary_location":{"id":"doi:10.1109/lcn.2010.5735701","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn.2010.5735701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Local Computer Network Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077459199","display_name":"Mohamed Aissa","orcid":"https://orcid.org/0000-0003-3491-8453"},"institutions":[{"id":"https://openalex.org/I209803261","display_name":"University of Nizwa","ror":"https://ror.org/01pxe3r04","country_code":"OM","type":"education","lineage":["https://openalex.org/I209803261"]}],"countries":["OM"],"is_corresponding":true,"raw_author_name":"Mohamed Aissa","raw_affiliation_strings":["College of Mathematical and Physical Sciences, Computer Science Section, University of Nizwa, Nizwa, Oman"],"affiliations":[{"raw_affiliation_string":"College of Mathematical and Physical Sciences, Computer Science Section, University of Nizwa, Nizwa, Oman","institution_ids":["https://openalex.org/I209803261"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066044844","display_name":"Adel Ben Mnaouer","orcid":"https://orcid.org/0000-0003-3617-7636"},"institutions":[{"id":"https://openalex.org/I4210149130","display_name":"Dar Al Uloom University","ror":"https://ror.org/03myd1n81","country_code":"SA","type":"education","lineage":["https://openalex.org/I4210149130"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Adel Ben Mnaouer","raw_affiliation_strings":["College of Computer Engineering and Information Technology, Dar Al Uloom University, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"College of Computer Engineering and Information Technology, Dar Al Uloom University, Saudi Arabia","institution_ids":["https://openalex.org/I4210149130"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027759845","display_name":"Abdelfettah Belghith","orcid":"https://orcid.org/0000-0002-4937-7453"},"institutions":[{"id":"https://openalex.org/I83259278","display_name":"Manouba University","ror":"https://ror.org/0503ejf32","country_code":"TN","type":"education","lineage":["https://openalex.org/I83259278"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Abdelfettah Belghith","raw_affiliation_strings":["HANA Research group, ENSI, University of Manouba, Tunisia"],"affiliations":[{"raw_affiliation_string":"HANA Research group, ENSI, University of Manouba, Tunisia","institution_ids":["https://openalex.org/I83259278"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077459199"],"corresponding_institution_ids":["https://openalex.org/I209803261"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21687694,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"200","last_page":"203"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.8569135069847107},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7730473875999451},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5823968648910522},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5767747759819031},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5651518106460571},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5409231781959534},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47662675380706787},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.46174079179763794},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.453734815120697},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.45065024495124817},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4415448307991028},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4415222704410553},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.4327698051929474},{"id":"https://openalex.org/keywords/protocol-independent-multicast","display_name":"Protocol Independent Multicast","score":0.4313380718231201},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41057395935058594},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.2414328157901764},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.21488136053085327},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.09664970636367798},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09211772680282593}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.8569135069847107},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7730473875999451},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5823968648910522},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5767747759819031},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5651518106460571},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5409231781959534},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47662675380706787},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46174079179763794},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.453734815120697},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.45065024495124817},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4415448307991028},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4415222704410553},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.4327698051929474},{"id":"https://openalex.org/C44892269","wikidata":"https://www.wikidata.org/wiki/Q782752","display_name":"Protocol Independent Multicast","level":3,"score":0.4313380718231201},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41057395935058594},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.2414328157901764},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.21488136053085327},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.09664970636367798},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09211772680282593},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcn.2010.5735701","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn.2010.5735701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Local Computer Network Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W50301502","https://openalex.org/W1528620663","https://openalex.org/W1553208973","https://openalex.org/W1976085508","https://openalex.org/W2016704567","https://openalex.org/W2105808107","https://openalex.org/W2120608001","https://openalex.org/W2126378415","https://openalex.org/W2127932081","https://openalex.org/W2130800685","https://openalex.org/W2136953059","https://openalex.org/W2141487810","https://openalex.org/W2152950844","https://openalex.org/W2166418855","https://openalex.org/W2169528473","https://openalex.org/W2243986870","https://openalex.org/W4361808430","https://openalex.org/W6640454886","https://openalex.org/W6679500961","https://openalex.org/W6680143578","https://openalex.org/W6844947723"],"related_works":["https://openalex.org/W2371847117","https://openalex.org/W4321384965","https://openalex.org/W80466176","https://openalex.org/W4239966178","https://openalex.org/W2370873522","https://openalex.org/W2080190883","https://openalex.org/W2393131931","https://openalex.org/W2542798775","https://openalex.org/W2099023627","https://openalex.org/W2352065055"],"abstract_inverted_index":{"In":[0,27],"a":[1,57,80,97,110],"dynamic":[2],"network":[3,76,128],"environment":[4],"under":[5],"heavy":[6],"traffic":[7,17],"load,":[8],"shortest-path":[9],"routing":[10,62],"algorithms,":[11],"particularly":[12],"attempt":[13],"to":[14,16,49,59,95,130],"adapt":[15],"changes,":[18],"frequently":[19],"exhibit":[20],"oscillatory":[21],"behaviors":[22],"and":[23,36,43,82,121,125],"cause":[24],"performance":[25],"degradation.":[26],"this":[28],"paper,":[29],"we":[30,55],"first":[31],"analyze,":[32],"the":[33,40,46,60,65,71,75,87,100,119,127],"instability":[34],"factors":[35],"their":[37],"results":[38],"in":[39,51,133],"multicast":[41],"infrastructure,":[42],"then":[44],"analyze":[45],"solutions":[47],"leading":[48],"stability":[50],"switched":[52],"networks.":[53],"Subsequently,":[54],"propose":[56,79],"solution":[58],"above":[61],"problem,":[63],"where":[64],"route":[66],"computation":[67],"is":[68,107],"based":[69,108],"on":[70,74,109],"actual":[72],"load":[73,129],"links.":[77],"We":[78],"fast":[81],"simple":[83,111],"heuristic":[84],"algorithm":[85,106],"named":[86],"Cost-Delay":[88],"Shortest":[89],"Path":[90],"(CDSP)":[91],"algorithm,":[92],"which":[93],"attempts":[94],"strike":[96],"balance":[98],"between":[99],"different":[101],"QoS":[102],"parameters.":[103],"The":[104],"CDSP":[105],"path":[112],"exponential":[113],"selection":[114],"function":[115],"taking":[116],"simultaneously":[117],"both":[118],"cost":[120],"delay":[122],"into":[123],"consideration":[124],"allowing":[126],"be":[131],"distributed":[132],"an":[134],"optimal":[135],"way.":[136]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}