{"id":"https://openalex.org/W2139142033","doi":"https://doi.org/10.1109/lcn.1999.802017","title":"The new shortest best path tree (SBPT) algorithm for dynamic multicast trees","display_name":"The new shortest best path tree (SBPT) algorithm for dynamic multicast trees","alternate_titles":[],"publication_year":2003,"publication_date":"2003-01-20","ids":{"openalex":"https://openalex.org/W2139142033","doi":"https://doi.org/10.1109/lcn.1999.802017","mag":"2139142033"},"language":"en","primary_location":{"id":"doi:10.1109/lcn.1999.802017","doi":"https://doi.org/10.1109/lcn.1999.802017","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn.1999.802017","pdf_url":null,"source":{"id":"https://openalex.org/S4210182868","display_name":"Conference on Local Computer Networks","issn_l":"0742-1303","issn":["0742-1303"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2139142033"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5083861866","display_name":"Hiroshi Fujinoki","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. Fujinoki","raw_affiliation_strings":["Department of Computer Science and Engineering, University of South Florida, Tampa, FL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of South Florida, Tampa, FL, USA","institution_ids":["https://openalex.org/I2613432"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053228309","display_name":"Kenneth J. Christensen","orcid":"https://orcid.org/0009-0003-4170-0521","observed_orcids":["https://orcid.org/0009-0003-4170-0521"]},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K.J. Christensen","raw_affiliation_strings":["Department of Computer Science and Engineering, University of South Florida, Tampa, FL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of South Florida, Tampa, FL, USA","institution_ids":["https://openalex.org/I2613432"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2613432"],"apc_list":null,"apc_paid":null,"fwci":1.1106,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.80323039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"204","last_page":"211"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9779999852180481,"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.9779999852180481,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.01679999940097332,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.002099999925121665,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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-tree","display_name":"multicast tree","score":0.7910000085830688},{"id":"https://openalex.org/keywords/dynamic-multicast","display_name":"dynamic multicast","score":0.671999990940094},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"shortest path tree","score":0.8700000047683716},{"id":"https://openalex.org/keywords/bandwidth-consumption","display_name":"bandwidth consumption","score":0.6660000085830688},{"id":"https://openalex.org/keywords/distributed-routing","display_name":"distributed routing","score":0.4440000057220459}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6092737913131714},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.5737796425819397},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5616811513900757},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5162070393562317},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4847073554992676},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.4341374933719635},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.414355605840683},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3725685179233551},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3714102506637573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2244509756565094},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1966908574104309},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16917237639427185},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.15086990594863892},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14225295186042786}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lcn.1999.802017","doi":"https://doi.org/10.1109/lcn.1999.802017","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn.1999.802017","pdf_url":null,"source":{"id":"https://openalex.org/S4210182868","display_name":"Conference on Local Computer Networks","issn_l":"0742-1303","issn":["0742-1303"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.556.5622","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.556.5622","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.siue.edu/~hfujino/SBPT.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1479884443","https://openalex.org/W1483709518","https://openalex.org/W1554317922","https://openalex.org/W2032320043","https://openalex.org/W2047083855","https://openalex.org/W2063354751","https://openalex.org/W2078179045","https://openalex.org/W2079994203","https://openalex.org/W2099379033","https://openalex.org/W2099526393","https://openalex.org/W2105808107","https://openalex.org/W2130748081","https://openalex.org/W2151250580","https://openalex.org/W2160015360","https://openalex.org/W2163059611","https://openalex.org/W2165743744","https://openalex.org/W2166418855","https://openalex.org/W2172222998","https://openalex.org/W6679283884"],"related_works":["https://openalex.org/W2078179045","https://openalex.org/W44808723","https://openalex.org/W41610833","https://openalex.org/W1947367101","https://openalex.org/W2040617361","https://openalex.org/W2474064504","https://openalex.org/W1714480694","https://openalex.org/W2109098376","https://openalex.org/W2181393071"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"the":[3,25,36,53,57,60,100,107,128],"new":[4],"shortest":[5,37,61,94,130],"best":[6],"path":[7,62,131],"tree":[8,63],"(SBPT)":[9],"algorithm":[10,16,45,49,70,87,109],"for":[11,39,80],"multicast":[12,21,82],"trees.":[13],"The":[14,43,68,85],"SBPT":[15,44,69,86,101,108],"establishes":[17],"and":[18,33,65,102,125],"maintains":[19],"dynamic":[20],"trees":[22],"which":[23],"maximize":[24],"bandwidth":[26,72,111],"to":[27,115],"be":[28],"shared":[29],"by":[30,74,113],"multiple":[31,93],"receivers":[32],"simultaneously":[34],"guarantee":[35],"paths":[38,77,91,95],"each":[40],"receiver":[41,83],"node.":[42],"is":[46,120],"a":[47],"distributed":[48],"with":[50],"cost":[51],"in":[52],"same":[54,129],"order":[55],"as":[56],"sum":[58],"of":[59],"(SPT)":[64],"Greedy":[66],"algorithms.":[67],"reduces":[71,110],"consumption":[73,112],"utilizing":[75],"partial":[76,90],"already":[78],"established":[79],"other":[81],"nodes.":[84],"finds":[88],"such":[89],"when":[92,117],"exist.":[96],"Simulation":[97],"experiments":[98],"comparing":[99],"SPT":[103],"algorithms":[104],"show":[105],"that":[106],"5%":[114],"17%":[116],"node":[118],"utilization":[119],"greater":[121],"than":[122],"approximately":[123],"25%":[124],"always":[126],"achieves":[127],"lengths.":[132]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2139142033","counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
