{"id":"https://openalex.org/W862290367","doi":null,"title":"A Distributed Delay-Constrained Multicasting for Static and Dynamic Multicast Groups","display_name":"A Distributed Delay-Constrained Multicasting for Static and Dynamic Multicast Groups","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W862290367","mag":"862290367"},"language":"en","primary_location":{"id":"mag:862290367","doi":null,"is_oa":false,"landing_page_url":"http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=GCSHCI_1999_v24n1A_78","pdf_url":null,"source":{"id":"https://openalex.org/S4306496539","display_name":"\ud55c\uad6d\ud1b5\uc2e0\ud559\ud68c\ub17c\ubb38\uc9c0","issn_l":"1226-4717","issn":["1226-4717","2287-3880"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"The Journal of Korean Institute of Communications and Information Sciences","raw_type":null},"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":"https://openalex.org/A5029624554","display_name":"Yongjun Im","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yong Jun Im","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5082049201","display_name":"Yang Hui Choe","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang Hui Choe","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":null,"first_page":"78","last_page":"78"},"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.9785000085830688,"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.9785000085830688,"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.010900000110268593,"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.005900000222027302,"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.902999997138977},{"id":"https://openalex.org/keywords/dynamic-multicast-groups","display_name":"dynamic multicast groups","score":1.0},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"quality of service","score":0.8700000047683716},{"id":"https://openalex.org/keywords/end-to-end-delay-bounds","display_name":"end-to-end delay bounds","score":0.8220000267028809},{"id":"https://openalex.org/keywords/message-complexity","display_name":"message complexity","score":0.7559999823570251}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.9489486217498779},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7737388610839844},{"id":"https://openalex.org/C44892269","wikidata":"https://www.wikidata.org/wiki/Q782752","display_name":"Protocol Independent Multicast","level":3,"score":0.7615338563919067},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7567617297172546},{"id":"https://openalex.org/C18787934","wikidata":"https://www.wikidata.org/wiki/Q7565105","display_name":"Source-specific multicast","level":3,"score":0.7408596873283386},{"id":"https://openalex.org/C42272142","wikidata":"https://www.wikidata.org/wiki/Q1229379","display_name":"Distance Vector Multicast Routing Protocol","level":4,"score":0.7324103713035583},{"id":"https://openalex.org/C192059732","wikidata":"https://www.wikidata.org/wiki/Q3823050","display_name":"Xcast","level":3,"score":0.7269788384437561},{"id":"https://openalex.org/C112037812","wikidata":"https://www.wikidata.org/wiki/Q2107523","display_name":"Pragmatic General Multicast","level":4,"score":0.6981212496757507},{"id":"https://openalex.org/C192240487","wikidata":"https://www.wikidata.org/wiki/Q17156927","display_name":"Multicast address","level":4,"score":0.6150838136672974},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5833273530006409},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.4955860376358032},{"id":"https://openalex.org/C174174714","wikidata":"https://www.wikidata.org/wiki/Q7310997","display_name":"Reliable multicast","level":4,"score":0.43327951431274414},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4213516116142273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24132102727890015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10158541798591614},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:862290367","doi":null,"is_oa":false,"landing_page_url":"http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=GCSHCI_1999_v24n1A_78","pdf_url":null,"source":{"id":"https://openalex.org/S4306496539","display_name":"\ud55c\uad6d\ud1b5\uc2e0\ud559\ud68c\ub17c\ubb38\uc9c0","issn_l":"1226-4717","issn":["1226-4717","2287-3880"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"The Journal of Korean Institute of Communications and Information Sciences","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1838473513","https://openalex.org/W2133381012","https://openalex.org/W2052947996","https://openalex.org/W1541236804","https://openalex.org/W2123710471","https://openalex.org/W2368508733","https://openalex.org/W2475131847","https://openalex.org/W1540593729","https://openalex.org/W2010910291","https://openalex.org/W2154548852"],"abstract_inverted_index":{"Multicasting":[0],"refers":[1],"to":[2,11],"concurrently":[3],"transmitting":[4],"the":[5,29,68,85,108,118,135,143],"same":[6],"data":[7],"from":[8],"a":[9,15,25,43,74,97],"source":[10],"multiple":[12],"destinations":[13],"in":[14,152],"packet":[16],"network.":[17],"To":[18],"handle":[19],"large":[20],"number":[21,119],"of":[22,77,95,113,120],"multicast":[23,45,50,100,150,160],"sessions,":[24],"network":[26,60,65,81,121,158],"must":[27],"minimize":[28],"sessions's":[30],"resource":[31],"consumption,":[32],"while":[33],"meeting":[34],"their":[35],"QoS":[36],"requirements.":[37],"In":[38],"this":[39],"paper,":[40],"we":[41],"propose":[42],"distributed":[44],"algorithm":[46,57,125,137],"for":[47,146],"constructing":[48,96],"minimum-cost":[49],"trees":[51],"with":[52],"delay":[53,165],"constraints.":[54],"The":[55,123],"proposed":[56,124,136],"requires":[58],"limited":[59],"state":[61],"information":[62],"at":[63],"each":[64],"node":[66],"and":[67,105,130,148,163],"routing":[69],"tree":[70],"is":[71,92,117,126,132],"computed":[72],"through":[73],"single":[75],"round":[76],"message":[78,111],"exchanges":[79],"between":[80],"nodes,":[82],"We":[83],"prove":[84],"algorithm's":[86],"correctness":[87],"by":[88,128],"showing":[89],"that":[90,134],"it":[91,106,131],"always":[93],"capable":[94],"delay-const":[98],"mined":[99],"tree,":[101],"if":[102],"one":[103],"exists,":[104],"has":[107],"worst":[109],"case":[110],"complexity":[112],"O(\u3163v\u31632),":[114],"where":[115],"\u3163V\u3163":[116],"nodes.":[122],"verified":[127],"simulation,":[129],"shown":[133],"exhibits":[138],"much":[139],"better":[140],"performance":[141],"than":[142],"existing":[144],"ones":[145],"static":[147],"dynamic":[149],"groups":[151],"all":[153],"circumstances,":[154],"which":[155],"include":[156],"various":[157],"sizes,":[159],"group":[161],"sizes":[162],"end-to-end":[164],"bounds.":[166]},"counts_by_year":[],"updated_date":"2026-10-31T12:09:11.096373","created_date":"2016-06-24T00:00:00"}