{"id":"https://openalex.org/W2136953059","doi":"https://doi.org/10.1109/icc.2000.853716","title":"Scalable multicast routing algorithm for delay-variation constrained minimum-cost tree","display_name":"Scalable multicast routing algorithm for delay-variation constrained minimum-cost tree","publication_year":2002,"publication_date":"2002-11-07","ids":{"openalex":"https://openalex.org/W2136953059","doi":"https://doi.org/10.1109/icc.2000.853716","mag":"2136953059"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2000.853716","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5090416921","display_name":"Hun-Young Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I101155339","display_name":"Korea Telecom (South Korea)","ror":"https://ror.org/043n4tt17","country_code":"KR","type":"company","lineage":["https://openalex.org/I101155339"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"None Hun-Young Lee","raw_affiliation_strings":["Hanaro Telecom, Information and Communications University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Hanaro Telecom, Information and Communications University, Seoul, South Korea","institution_ids":["https://openalex.org/I101155339"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045403869","display_name":"Chan\u2010Hyun Youn","orcid":"https://orcid.org/0000-0002-3970-7308"},"institutions":[{"id":"https://openalex.org/I101155339","display_name":"Korea Telecom (South Korea)","ror":"https://ror.org/043n4tt17","country_code":"KR","type":"company","lineage":["https://openalex.org/I101155339"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"None Chan-Hyun Youn","raw_affiliation_strings":["Hanaro Telecom, Information and Communications University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Hanaro Telecom, Information and Communications University, Seoul, South Korea","institution_ids":["https://openalex.org/I101155339"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.933,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":20,"citation_normalized_percentile":{"value":0.881869,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":85,"max":86},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998,"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.9998,"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.9993,"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.9984,"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/heuristics","display_name":"Heuristics","score":0.60635364},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5774528},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4652641}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.8876213},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.81492245},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.62586313},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.60635364},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5774528},{"id":"https://openalex.org/C44892269","wikidata":"https://www.wikidata.org/wiki/Q782752","display_name":"Protocol Independent Multicast","level":3,"score":0.53760374},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.53061724},{"id":"https://openalex.org/C192059732","wikidata":"https://www.wikidata.org/wiki/Q3823050","display_name":"Xcast","level":3,"score":0.50266194},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46635664},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4652641},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.45214447},{"id":"https://openalex.org/C18787934","wikidata":"https://www.wikidata.org/wiki/Q7565105","display_name":"Source-specific multicast","level":3,"score":0.4321261},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35663855},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24199092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10845563},{"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2000.853716","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":8,"referenced_works":["https://openalex.org/W1600363470","https://openalex.org/W1928383509","https://openalex.org/W1975290397","https://openalex.org/W1976085508","https://openalex.org/W2099526393","https://openalex.org/W2127240180","https://openalex.org/W2166418855","https://openalex.org/W2168151073"],"related_works":["https://openalex.org/W80466176","https://openalex.org/W4321384965","https://openalex.org/W2393131931","https://openalex.org/W2382719989","https://openalex.org/W2371847117","https://openalex.org/W2347553438","https://openalex.org/W2161099791","https://openalex.org/W2099023627","https://openalex.org/W2080190883","https://openalex.org/W1528315273"],"abstract_inverted_index":{"The":[0,103],"delay-constrained":[1],"heuristics":[2,29],"for":[3,58,69,115],"multicast":[4,101,127],"routing":[5],"algorithms":[6],"capable":[7],"of":[8,12,15,27,99],"satisfying":[9],"the":[10,47,74,94,100,108,112],"quality":[11],"services":[13],"requirements":[14],"real":[16],"time":[17,48,121],"applications":[18],"are":[19,44],"essential":[20],"under":[21],"distributed":[22],"network":[23,42],"environments.":[24],"However,":[25],"some":[26],"these":[28],"may":[30],"fail":[31],"to":[32,67,126],"provide":[33],"a":[34,52,64,82],"low":[35],"cost":[36,96],"tree":[37,53],"as":[38,61,90,92],"they":[39,62],"assume":[40],"that":[41,107],"links":[43],"symmetric.":[45],"Furthermore,":[46],"required":[49],"constructing":[50],"such":[51],"might":[54],"be":[55],"prohibitive,":[56],"especially":[57],"large":[59,130],"networks,":[60],"employ":[63],"brute-force":[65],"approach":[66],"search":[68],"low-cost":[70],"delay-bounded":[71],"paths":[72],"among":[73],"route":[75],"candidates.":[76],"In":[77],"this":[78],"paper,":[79],"we":[80],"propose":[81],"new":[83],"efficient":[84],"algorithm":[85,110],"considering":[86],"delay":[87],"variation":[88],"constraints":[89],"well":[91],"with":[93],"total":[95],"minimization":[97],"scheme":[98],"trees.":[102],"extensive":[104],"simulations":[105],"show":[106],"proposed":[109],"satisfies":[111],"QoS":[113],"requirement":[114],"real-time":[116],"traffic,":[117],"very":[118],"short":[119],"execution":[120],"and":[122],"good":[123],"scalability":[124],"applicable":[125],"groups":[128],"in":[129],"networks.":[131]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2136953059","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2024-12-12T22:26:34.204804","created_date":"2016-06-24"}