{"id":"https://openalex.org/W146926302","doi":null,"title":"An Efficient Distributed Routing Algorithm for Delay Constrained Multicast","display_name":"An Efficient Distributed Routing Algorithm for Delay Constrained Multicast","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W146926302","mag":"146926302"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.1281","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.1281","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://atnac2003.atcrc.com/ORALS/Tran.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Hieu T. Tran","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Hieu T. Tran","raw_affiliation_strings":["[RMIT University]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[RMIT University]","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002757843","display_name":"Richard Harris","orcid":"https://orcid.org/0000-0001-7943-9005","observed_orcids":["https://orcid.org/0000-0001-7943-9005"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Richard J. Harris","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":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.986299991607666,"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.986299991607666,"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.009399999864399433,"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.0008999999845400453,"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-routing","display_name":"multicast routing","score":0.6769999861717224},{"id":"https://openalex.org/keywords/multicast-tree","display_name":"multicast tree","score":0.5580000281333923},{"id":"https://openalex.org/keywords/dynamic-qos","display_name":"dynamic QoS","score":0.6460000276565552},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.9169999957084656},{"id":"https://openalex.org/keywords/distributed-routing-algorithm","display_name":"distributed routing algorithm","score":0.9259999990463257}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.8930318355560303},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.778997540473938},{"id":"https://openalex.org/C44892269","wikidata":"https://www.wikidata.org/wiki/Q782752","display_name":"Protocol Independent Multicast","level":3,"score":0.7162110209465027},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.7108615636825562},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6694787740707397},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6648873686790466},{"id":"https://openalex.org/C18787934","wikidata":"https://www.wikidata.org/wiki/Q7565105","display_name":"Source-specific multicast","level":3,"score":0.6453827619552612},{"id":"https://openalex.org/C42272142","wikidata":"https://www.wikidata.org/wiki/Q1229379","display_name":"Distance Vector Multicast Routing Protocol","level":4,"score":0.6165821552276611},{"id":"https://openalex.org/C192059732","wikidata":"https://www.wikidata.org/wiki/Q3823050","display_name":"Xcast","level":3,"score":0.5917476415634155},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5160457491874695},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49730613827705383},{"id":"https://openalex.org/C112037812","wikidata":"https://www.wikidata.org/wiki/Q2107523","display_name":"Pragmatic General Multicast","level":4,"score":0.4723445177078247},{"id":"https://openalex.org/C5111613","wikidata":"https://www.wikidata.org/wiki/Q3799443","display_name":"Inter-domain","level":4,"score":0.42588526010513306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09794363379478455},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06312829256057739},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.1281","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.1281","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://atnac2003.atcrc.com/ORALS/Tran.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":10,"referenced_works":["https://openalex.org/W1501194549","https://openalex.org/W1551891103","https://openalex.org/W1834436800","https://openalex.org/W2058299682","https://openalex.org/W2105808107","https://openalex.org/W2130626677","https://openalex.org/W2148837283","https://openalex.org/W2161201881","https://openalex.org/W2166418855","https://openalex.org/W2496220682"],"related_works":["https://openalex.org/W2154548852","https://openalex.org/W2368508733","https://openalex.org/W1858291149","https://openalex.org/W1894948906","https://openalex.org/W2123078418","https://openalex.org/W2354409817","https://openalex.org/W2475131847","https://openalex.org/W1541236804","https://openalex.org/W2169070721","https://openalex.org/W862290367"],"abstract_inverted_index":{"For":[0],"dynamic":[1],"QoS":[2,45],"multicast":[3,30,105],"routing,":[4],"efficient":[5],"handling":[6,87],"of":[7,21,71,77,86,93],"node's":[8],"join":[9,88],"and":[10,36,68,96],"leave":[11],"is":[12,53,63,84],"an":[13,28],"important":[14],"problem.":[15],"This":[16],"paper":[17],"addresses":[18],"the":[19,72,82],"problem":[20],"optimally":[22],"connecting":[23],"a":[24,44,48,102],"new":[25],"node":[26],"to":[27],"existing":[29],"tree":[31,97],"under":[32],"sourceto":[33],"-destination":[34],"delay":[35,38,49],"inter-destination":[37],"variation":[39],"constraints":[40],"(MRDC-JOIN).":[41],"We":[42],"assume":[43],"framework":[46],"where":[47],"dependent":[50],"cost":[51,98],"function":[52],"associated":[54],"with":[55,101],"each":[56],"network":[57],"link.":[58],"After":[59],"showing":[60],"that":[61,81],"MRDC-JOIN":[62],"NPcomplete,":[64],"we":[65,79],"present":[66],"centralized":[67,103],"distributed":[69],"versions":[70],"algorithm":[73,83,107],"MRDC-JOIN.":[74],"By":[75],"means":[76],"simulation,":[78],"show":[80],"capable":[85],"requests":[89],"efficiently":[90],"in":[91,99],"terms":[92],"success":[94],"rate":[95],"comparison":[100],"static":[104],"routing":[106],"[1].":[108]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}