{"id":"https://openalex.org/W1976085508","doi":"https://doi.org/10.1109/jcn.2000.6596737","title":"QDMR: An efficient QoS dependent multicast routing algorithm","display_name":"QDMR: An efficient QoS dependent multicast routing algorithm","publication_year":2000,"publication_date":"2000-06-01","ids":{"openalex":"https://openalex.org/W1976085508","doi":"https://doi.org/10.1109/jcn.2000.6596737","mag":"1976085508"},"language":"en","primary_location":{"id":"doi:10.1109/jcn.2000.6596737","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jcn.2000.6596737","pdf_url":null,"source":{"id":"https://openalex.org/S173102057","display_name":"Journal of Communications and Networks","issn_l":"1229-2370","issn":["1229-2370","1976-5541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Communications and Networks","raw_type":"journal-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/A5044678468","display_name":"Ibrahim Matta","orcid":"https://orcid.org/0000-0003-4528-0344"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ibrahim Matta","raw_affiliation_strings":["Computer Science Department, Boston University, Boston, MA 02215, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Boston University, Boston, MA 02215, USA","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025402599","display_name":"Liang Guo","orcid":"https://orcid.org/0000-0002-1826-7999"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Liang Guo","raw_affiliation_strings":["Computer Science Department, Boston University, Boston, MA 02215, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Boston University, Boston, MA 02215, USA","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044678468"],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":4.7147,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.94888493,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"2","issue":"2","first_page":"168","last_page":"176"},"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.9998000264167786,"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.9998000264167786,"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.9984999895095825,"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.9980000257492065,"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.9351180791854858},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8870624899864197},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6748296022415161},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6166518330574036},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6075937747955322},{"id":"https://openalex.org/keywords/protocol-independent-multicast","display_name":"Protocol Independent Multicast","score":0.5640825033187866},{"id":"https://openalex.org/keywords/xcast","display_name":"Xcast","score":0.5409013628959656},{"id":"https://openalex.org/keywords/source-specific-multicast","display_name":"Source-specific multicast","score":0.5302576422691345},{"id":"https://openalex.org/keywords/distance-vector-multicast-routing-protocol","display_name":"Distance Vector Multicast Routing Protocol","score":0.48679468035697937},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.46184083819389343},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.44817909598350525},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4383414089679718},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32312411069869995},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.060996949672698975}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.9351180791854858},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8870624899864197},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6748296022415161},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6166518330574036},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6075937747955322},{"id":"https://openalex.org/C44892269","wikidata":"https://www.wikidata.org/wiki/Q782752","display_name":"Protocol Independent Multicast","level":3,"score":0.5640825033187866},{"id":"https://openalex.org/C192059732","wikidata":"https://www.wikidata.org/wiki/Q3823050","display_name":"Xcast","level":3,"score":0.5409013628959656},{"id":"https://openalex.org/C18787934","wikidata":"https://www.wikidata.org/wiki/Q7565105","display_name":"Source-specific multicast","level":3,"score":0.5302576422691345},{"id":"https://openalex.org/C42272142","wikidata":"https://www.wikidata.org/wiki/Q1229379","display_name":"Distance Vector Multicast Routing Protocol","level":4,"score":0.48679468035697937},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.46184083819389343},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.44817909598350525},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4383414089679718},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32312411069869995},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.060996949672698975},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/jcn.2000.6596737","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jcn.2000.6596737","pdf_url":null,"source":{"id":"https://openalex.org/S173102057","display_name":"Journal of Communications and Networks","issn_l":"1229-2370","issn":["1229-2370","1976-5541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Communications and Networks","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.33.8116","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.8116","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bu.edu/faculty/matta/Papers/jcn00.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.83.3406","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.3406","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bu.edu/fac/matta/Papers/jcn00.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"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":18,"referenced_works":["https://openalex.org/W1502684340","https://openalex.org/W1966086139","https://openalex.org/W1975290397","https://openalex.org/W2011039300","https://openalex.org/W2032741749","https://openalex.org/W2042492403","https://openalex.org/W2099526393","https://openalex.org/W2105808107","https://openalex.org/W2127240180","https://openalex.org/W2129738449","https://openalex.org/W2130748081","https://openalex.org/W2148836938","https://openalex.org/W2158283087","https://openalex.org/W2166418855","https://openalex.org/W2168151073","https://openalex.org/W2476096155","https://openalex.org/W2752885492","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2371847117","https://openalex.org/W80466176","https://openalex.org/W4321384965","https://openalex.org/W2080190883","https://openalex.org/W2036328685","https://openalex.org/W2135962664","https://openalex.org/W2347553438","https://openalex.org/W2608999883","https://openalex.org/W2131676052","https://openalex.org/W4239966178"],"abstract_inverted_index":{"Many":[0],"distributed":[1],"real-time":[2,99],"applications,":[3],"such":[4,55,204],"as":[5],"audio-and":[6],"video-conferencing":[7],"and":[8,31,64,89,216,225],"collaborative":[9],"systems,":[10],"require":[11],"multicast":[12,82,125,193,210,240],"support":[13],"from":[14,152],"the":[15,20,29,36,43,147,154,166,173,184,197,218,230],"underlying":[16],"network.":[17],"Multicasting":[18],"involves":[19],"delivery":[21,95],"of":[22,42,86,131,168,178,232],"messages":[23],"over":[24],"a":[25,49,56,116,191],"tree":[26,50,57,140,162,175,194,205,211,219],"rooted":[27],"at":[28],"sender":[30],"whose":[32],"paths":[33,171],"lead":[34,182],"to":[35,47,60,70,79,183,237],"various":[37],"receivers.":[38],"A":[39,128],"major":[40],"objective":[41],"routing":[44,126],"protocol":[45],"is":[46,58,133,151,212],"build":[48],"with":[51,165],"minimum":[52],"cost.":[53,222],"Finding":[54],"known":[59],"be":[61,201],"computationally":[62],"expensive,":[63],"many":[65,238],"heuristics":[66,77,103],"have":[67],"been":[68],"proposed":[69],"efficiently":[71,80],"find":[72,81],"near-optimal":[73],"trees.":[74,127],"Moreover,":[75],"some":[76],"exist":[78],"trees":[83],"that":[84,134,190],"are":[85,104],"low":[87,221],"cost":[88],"satisfy":[90],"Quality-of-Service":[91],"(QoS)":[92],"(e.g.,":[93],"delay)":[94,199],"constraints":[96],"required":[97],"by":[98,234],"applications.":[100],"However,":[101],"these":[102],"not":[105],"fast":[106,117],"enough":[107],"for":[108,121],"large-scale":[109],"networks.":[110],"In":[111],"this":[112,208],"paper,":[113],"we":[114,228],"present":[115],"algorithm,":[118],"called":[119],"QDMR,":[120],"generating":[122],"delay-constrained":[123],"low-cost":[124,139,174],"salient":[129],"feature":[130],"QDMR":[132,188,233],"it":[135,236],"dynamically":[136],"adjusts":[137],"its":[138],"construction":[141],"policy":[142],"based":[143],"on":[144],"how":[145],"far":[146],"current":[148],"on-tree":[149],"node":[150],"violating":[153],"QoS":[155,159],"delay":[156,180],"bound.":[157],"This":[158],"dependent":[160],"(adaptive)":[161],"construction,":[163],"together":[164],"capability":[167],"merging":[169],"least-delay":[170],"into":[172],"in":[176],"case":[177],"stringent":[179],"requirements,":[181],"following":[185],"properties:":[186],"1)":[187],"guarantees":[189],"feasible":[192],"(that":[195],"satisfies":[196],"requested":[198],"will":[200],"found":[202],"if":[203],"exists;":[206],"2)":[207],"delay-bounded":[209],"very":[213],"rapidly":[214],"generated;":[215],"3)":[217],"has":[220],"Through":[223],"analysis":[224],"extensive":[226],"simulations,":[227],"confirm":[229],"premise":[231],"comparing":[235],"existing":[239],"algorithms.":[241]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}