{"id":"https://openalex.org/W3138020119","doi":"https://doi.org/10.1109/ccwc51732.2021.9375923","title":"A Broadcasting Heuristic for Hypercube of Trees","display_name":"A Broadcasting Heuristic for Hypercube of Trees","publication_year":2021,"publication_date":"2021-01-27","ids":{"openalex":"https://openalex.org/W3138020119","doi":"https://doi.org/10.1109/ccwc51732.2021.9375923","mag":"3138020119"},"language":"en","primary_location":{"id":"doi:10.1109/ccwc51732.2021.9375923","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccwc51732.2021.9375923","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 11th Annual Computing and Communication Workshop and Conference (CCWC)","raw_type":"proceedings-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/A5025343535","display_name":"Saber Gholami","orcid":"https://orcid.org/0000-0002-6275-3388"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Saber Gholami","raw_affiliation_strings":["Concordia University,Dept. of Computer Science and Software Engineering,Montr&#x00E9;al,Canada"],"affiliations":[{"raw_affiliation_string":"Concordia University,Dept. of Computer Science and Software Engineering,Montr&#x00E9;al,Canada","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090172873","display_name":"Hovhannes A. Harutyunyan","orcid":"https://orcid.org/0000-0001-7260-4186"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Hovhannes A. Harutyunyan","raw_affiliation_strings":["Concordia University,Dept. of Computer Science and Software Engineering,Montr&#x00E9;al,Canada"],"affiliations":[{"raw_affiliation_string":"Concordia University,Dept. of Computer Science and Software Engineering,Montr&#x00E9;al,Canada","institution_ids":["https://openalex.org/I60158472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025343535"],"corresponding_institution_ids":["https://openalex.org/I60158472"],"apc_list":null,"apc_paid":null,"fwci":0.6113,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68418247,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"150","issue":null,"first_page":"0355","last_page":"0361"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T10829","display_name":"Interconnection Networks and Systems","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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9983000159263611,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.9125372171401978},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7745445966720581},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.704552173614502},{"id":"https://openalex.org/keywords/broadcasting","display_name":"Broadcasting (networking)","score":0.6634679436683655},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6302609443664551},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5952329635620117},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5100260376930237},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.509524405002594},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4304559528827667},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4051232635974884},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3519018292427063},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3506932258605957},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3254414200782776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19796162843704224},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10835063457489014},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10556802153587341}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.9125372171401978},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7745445966720581},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.704552173614502},{"id":"https://openalex.org/C110157686","wikidata":"https://www.wikidata.org/wiki/Q922122","display_name":"Broadcasting (networking)","level":2,"score":0.6634679436683655},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6302609443664551},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5952329635620117},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5100260376930237},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.509524405002594},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4304559528827667},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4051232635974884},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3519018292427063},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3506932258605957},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3254414200782776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19796162843704224},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10835063457489014},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10556802153587341},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ccwc51732.2021.9375923","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccwc51732.2021.9375923","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE 11th Annual Computing and Communication Workshop and Conference (CCWC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W15772922","https://openalex.org/W61637013","https://openalex.org/W163398820","https://openalex.org/W1536362626","https://openalex.org/W1540705509","https://openalex.org/W1569584388","https://openalex.org/W1820234548","https://openalex.org/W1918603512","https://openalex.org/W1994593991","https://openalex.org/W1998169461","https://openalex.org/W2002566775","https://openalex.org/W2004232248","https://openalex.org/W2010178885","https://openalex.org/W2017306767","https://openalex.org/W2035439570","https://openalex.org/W2045371181","https://openalex.org/W2083990694","https://openalex.org/W2094481020","https://openalex.org/W2101641524","https://openalex.org/W2104394127","https://openalex.org/W2107886177","https://openalex.org/W2119420156","https://openalex.org/W2794195900","https://openalex.org/W4240682706","https://openalex.org/W4241840173","https://openalex.org/W4252364404","https://openalex.org/W4297731820","https://openalex.org/W6602480433","https://openalex.org/W6606683083","https://openalex.org/W6632283733"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W1583254070","https://openalex.org/W2394113672","https://openalex.org/W2013252038","https://openalex.org/W2386598361","https://openalex.org/W2078375028"],"abstract_inverted_index":{"Broadcasting":[0],"is":[1,15,24,64,145],"the":[2,30,37,51,77,103,107,118,123,149,158,180,183,188],"process":[3],"of":[4,6,29,39,48,70,76,96,102,109,157,165,182],"dissemination":[5],"information":[7],"in":[8,44,93,98,140,153,161],"a":[9,12,45,67,88,94,110,128],"network":[10,31,184],"where":[11],"particular":[13],"message":[14],"sent":[16],"starting":[17],"from":[18],"an":[19,60,162],"originator.":[20],"The":[21],"ultimate":[22],"objective":[23],"to":[25,56,147,155],"inform":[26],"all":[27],"entities":[28],"as":[32,34,73,122],"soon":[33],"possible.":[35],"Besides,":[36],"theory":[38],"broadcasting":[40,92],"has":[41,53],"been":[42,54],"used":[43],"wide":[46],"range":[47],"applications.":[49],"Although":[50],"problem":[52],"proven":[55],"be":[57,106],"NP-Complete":[58],"for":[59,66,91],"arbitrary":[61],"graph,":[62],"it":[63,173],"tractable":[65],"few":[68],"families":[69],"networks,":[71],"such":[72],"Hypercubes,":[74],"one":[75],"most":[78,141],"successful":[79],"large-scale":[80],"parallel":[81],"architectures.":[82],"In":[83],"this":[84,115],"paper,":[85],"we":[86],"propose":[87],"new":[89],"heuristic":[90,116,144,190],"hypercube":[95,104],"trees":[97],"which":[99,186],"each":[100],"vertex":[101],"could":[105],"root":[108],"tree.":[111],"Not":[112],"only":[113],"does":[114],"have":[117],"same":[119],"approximation":[120],"ratio":[121],"best-known":[124],"algorithm":[125],"and":[126],"provide":[127],"good":[129],"theoretical":[130],"bound,":[131],"but":[132],"our":[133,169],"numerical":[134],"results":[135,170],"also":[136],"show":[137],"its":[138,176],"superiority":[139],"experiments.":[142],"Our":[143],"able":[146],"outperform":[148],"current":[150],"upper":[151],"bound":[152],"up":[154],"90%":[156],"situations,":[159],"resulting":[160],"average":[163],"speedup":[164],"30%.":[166],"Most":[167],"importantly,":[168],"illustrate":[171],"that":[172],"can":[174],"maintain":[175],"performance":[177],"even":[178],"if":[179],"size":[181],"grows,":[185],"makes":[187],"proposed":[189],"practically":[191],"useful.":[192]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
