{"id":"https://openalex.org/W1580911267","doi":"https://doi.org/10.1109/icccn.2002.1043084","title":"Efficient implementations of bounded shortest multicast algorithm","display_name":"Efficient implementations of bounded shortest multicast algorithm","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W1580911267","doi":"https://doi.org/10.1109/icccn.2002.1043084","mag":"1580911267"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2002.1043084","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2002.1043084","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","raw_type":"proceedings-article"},"type":"conference-paper","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/A5082124101","display_name":"Gang Feng","orcid":"https://orcid.org/0000-0001-8508-8416"},"institutions":[{"id":"https://openalex.org/I1745920","display_name":"University of Wisconsin\u2013Platteville","ror":"https://ror.org/02xpkhc07","country_code":"US","type":"education","lineage":["https://openalex.org/I1745920"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gang Feng","raw_affiliation_strings":["Department of Electrical Engineering, University of Wisconsin, Platteville, WI, USA","Dept. of Electr. Eng., Wisconsin Univ., Platteville, WI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Wisconsin, Platteville, WI, USA","institution_ids":["https://openalex.org/I1745920"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Wisconsin Univ., Platteville, WI, USA","institution_ids":["https://openalex.org/I1745920"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111460486","display_name":"Kia Mao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kia Mao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5053321566","display_name":"N. Pissinoul","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N. Pissinoul","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"312","last_page":"317"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9980999827384949,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7310011982917786},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7194074988365173},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6638253927230835},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5931419134140015},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5849571228027344},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5340546369552612},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5090612769126892},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5038174986839294},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.43594396114349365},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3528482913970947},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22598391771316528},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21414700150489807},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.20558220148086548},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1512143909931183},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10009676218032837}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.7310011982917786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7194074988365173},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6638253927230835},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5931419134140015},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5849571228027344},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5340546369552612},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5090612769126892},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5038174986839294},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.43594396114349365},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3528482913970947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22598391771316528},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21414700150489807},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.20558220148086548},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1512143909931183},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10009676218032837},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icccn.2002.1043084","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2002.1043084","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.132.3012","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.3012","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.uwplatt.edu/~fengg/paper/icccn02.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1492653358","https://openalex.org/W1976085508","https://openalex.org/W2011039300","https://openalex.org/W2064457160","https://openalex.org/W2105808107","https://openalex.org/W2112029283","https://openalex.org/W2112169033","https://openalex.org/W2125690626","https://openalex.org/W2127240180","https://openalex.org/W2130748081","https://openalex.org/W2131058166","https://openalex.org/W2148837283","https://openalex.org/W2169528473","https://openalex.org/W4285719527","https://openalex.org/W6629309055"],"related_works":["https://openalex.org/W4298026806","https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W2990531685","https://openalex.org/W4310124294"],"abstract_inverted_index":{"The":[0,81],"constrained":[1],"minimum":[2],"Steiner":[3],"tree":[4],"(CMST)":[5],"problem":[6,37],"is":[7,86],"a":[8,48,55,62,67,126],"key":[9],"issue":[10],"in":[11,69,104],"multicast":[12],"routing":[13],"with":[14,47],"quality":[15],"of":[16,30,78,84,92,95,109,113,141],"service":[17],"(QoS)":[18],"support.":[19],"Bounded":[20],"shortest":[21],"path":[22,64,123],"algorithm":[23,45,58],"(BSMA)":[24],"has":[25],"been":[26],"recognized":[27],"as":[28],"one":[29],"the":[31,35,70,76,79,93,96,107,121,138,145],"best":[32],"algorithms":[33],"for":[34,61,124],"CMST":[36],"due":[38],"to":[39,59,65,119],"its":[40,87],"excellent":[41],"cost":[42,77,146],"performance.":[43,147],"This":[44],"starts":[46],"minimum-delay":[49],"tree,":[50,72],"and":[51,73],"then":[52],"iteratively":[53],"uses":[54],"k-shortest-path":[56],"(KSP)":[57],"search":[60],"better":[63],"replace":[66],"\"superedge\"":[68],"existing":[71],"consequently":[74],"reduces":[75],"tree.":[80],"major":[82],"drawback":[83],"BSMA":[85,114,142],"high":[88],"time":[89,139],"complexity":[90,140],"because":[91],"use":[94],"KSP":[97],"algorithm.":[98],"For":[99],"this":[100,105],"reason,":[101],"we":[102],"investigate":[103],"paper":[106],"possibility":[108],"more":[110],"efficient":[111],"implementations":[112],"by":[115],"using":[116],"different":[117],"methods":[118,134],"locate":[120],"target":[122],"replacing":[125],"superedge.":[127],"Our":[128],"experimental":[129],"results":[130],"indicate":[131],"that":[132],"our":[133],"can":[135],"significantly":[136],"reduce":[137],"without":[143],"deteriorating":[144]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}