{"id":"https://openalex.org/W7138849790","doi":"https://doi.org/10.1109/globecom59602.2025.11431968","title":"A Dual-Queue Asynchronous Parallel Algorithm for Multicriteria Optimal Path Computation","display_name":"A Dual-Queue Asynchronous Parallel Algorithm for Multicriteria Optimal Path Computation","publication_year":2025,"publication_date":"2025-12-08","ids":{"openalex":"https://openalex.org/W7138849790","doi":"https://doi.org/10.1109/globecom59602.2025.11431968"},"language":null,"primary_location":{"id":"doi:10.1109/globecom59602.2025.11431968","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11431968","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5111676575","display_name":"Xiaoqing Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210136246","display_name":"China Telecom (China)","ror":"https://ror.org/03jgnzt20","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210136246"]},{"id":"https://openalex.org/I4387153335","display_name":"China Telecom","ror":"https://ror.org/05p67dv18","country_code":null,"type":"company","lineage":["https://openalex.org/I4387153335"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoqing Xu","raw_affiliation_strings":["China Telecom Research Institute,Guangzhou,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"China Telecom Research Institute,Guangzhou,China","institution_ids":["https://openalex.org/I4210136246","https://openalex.org/I4387153335"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100404849","display_name":"Ning Zhang","orcid":"https://orcid.org/0000-0002-1920-0649"},"institutions":[{"id":"https://openalex.org/I4210136246","display_name":"China Telecom (China)","ror":"https://ror.org/03jgnzt20","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210136246"]},{"id":"https://openalex.org/I4387153335","display_name":"China Telecom","ror":"https://ror.org/05p67dv18","country_code":null,"type":"company","lineage":["https://openalex.org/I4387153335"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ning Zhang","raw_affiliation_strings":["China Telecom Research Institute,Guangzhou,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"China Telecom Research Institute,Guangzhou,China","institution_ids":["https://openalex.org/I4210136246","https://openalex.org/I4387153335"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130053068","display_name":"Juan Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210136246","display_name":"China Telecom (China)","ror":"https://ror.org/03jgnzt20","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210136246"]},{"id":"https://openalex.org/I4387153335","display_name":"China Telecom","ror":"https://ror.org/05p67dv18","country_code":null,"type":"company","lineage":["https://openalex.org/I4387153335"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Juan Wu","raw_affiliation_strings":["China Telecom Research Institute,Guangzhou,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"China Telecom Research Institute,Guangzhou,China","institution_ids":["https://openalex.org/I4210136246","https://openalex.org/I4387153335"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101792426","display_name":"Xiaojun Liu","orcid":"https://orcid.org/0000-0002-4253-1323"},"institutions":[{"id":"https://openalex.org/I4210136246","display_name":"China Telecom (China)","ror":"https://ror.org/03jgnzt20","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210136246"]},{"id":"https://openalex.org/I4387153335","display_name":"China Telecom","ror":"https://ror.org/05p67dv18","country_code":null,"type":"company","lineage":["https://openalex.org/I4387153335"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaojun Liu","raw_affiliation_strings":["China Telecom Research Institute,Guangzhou,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"China Telecom Research Institute,Guangzhou,China","institution_ids":["https://openalex.org/I4210136246","https://openalex.org/I4387153335"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5129783939","display_name":"Hong Tang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210136246","display_name":"China Telecom (China)","ror":"https://ror.org/03jgnzt20","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210136246"]},{"id":"https://openalex.org/I4387153335","display_name":"China Telecom","ror":"https://ror.org/05p67dv18","country_code":null,"type":"company","lineage":["https://openalex.org/I4387153335"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hong Tang","raw_affiliation_strings":["China Telecom Research Institute,Guangzhou,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"China Telecom Research Institute,Guangzhou,China","institution_ids":["https://openalex.org/I4210136246","https://openalex.org/I4387153335"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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":"3837","last_page":"3842"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.45730000734329224,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.45730000734329224,"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"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.1581999957561493,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.06360000371932983,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computation","display_name":"Computation","score":0.6676999926567078},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6578999757766724},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5630000233650208},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5198000073432922},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4691999852657318},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4456999897956848},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.4296000003814697},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.41440001130104065},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.351500004529953}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.79830002784729},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6676999926567078},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6578999757766724},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5630000233650208},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5600000023841858},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5483999848365784},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5198000073432922},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4691999852657318},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4456999897956848},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.4296000003814697},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.41440001130104065},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.351500004529953},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34299999475479126},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.325300008058548},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30320000648498535},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.2930000126361847},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.2872999906539917},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.28380000591278076},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2815000116825104},{"id":"https://openalex.org/C150495011","wikidata":"https://www.wikidata.org/wiki/Q128392","display_name":"Concurrent computing","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.26750001311302185},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C11644782","wikidata":"https://www.wikidata.org/wiki/Q15401790","display_name":"Cost efficiency","level":2,"score":0.263700008392334},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.2621000111103058},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C176553487","wikidata":"https://www.wikidata.org/wiki/Q7855819","display_name":"Turnaround time","level":2,"score":0.25839999318122864}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/globecom59602.2025.11431968","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11431968","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W640136309","https://openalex.org/W1527511816","https://openalex.org/W1998259641","https://openalex.org/W2051956023","https://openalex.org/W2052229697","https://openalex.org/W2085041447","https://openalex.org/W2149079374","https://openalex.org/W2309478456","https://openalex.org/W3159998597","https://openalex.org/W3171745483","https://openalex.org/W4404917949"],"related_works":[],"abstract_inverted_index":{"Emerging":[0],"network":[1,33],"services":[2],"like":[3],"live":[4],"streaming":[5],"and":[6,35,68,130,143,156],"cloud":[7],"gaming,":[8],"impose":[9],"strict":[10],"Quality-of-Service":[11],"(QoS)":[12],"demands,":[13],"necessitating":[14],"efficient":[15],"multicriteria":[16,24,47,178],"optimal":[17,48],"path":[18,49,65,179],"computation":[19,50,180],"(MOPC)":[20],"for":[21,153],"routing.":[22],"However,":[23],"pathfinding":[25],"is":[26],"NP-hard,":[27],"with":[28,106],"computational":[29],"complexity":[30],"escalating":[31],"as":[32],"scale":[34],"criteria":[36],"number":[37,158],"increase.":[38],"While":[39],"parallel":[40,46,60,177],"computing":[41],"promises":[42],"acceleration,":[43],"research":[44],"on":[45],"remains":[51],"scarce.":[52],"In":[53],"this":[54],"paper,":[55],"we":[56,84],"propose":[57],"an":[58],"asynchronous":[59],"framework":[61,164],"that":[62,137],"decouples":[63],"traditional":[64],"(label)":[66],"expansion":[67],"path-set":[69],"update":[70,121],"operations,":[71],"enabling":[72],"these":[73],"computationally":[74],"intensive":[75],"tasks":[76],"to":[77,90,111,120,168],"execute":[78],"independently":[79],"across":[80],"multi-core":[81],"processors.":[82],"Specifically,":[83],"design":[85],"a":[86],"dual":[87],"shared-queue":[88],"structure":[89],"temporarily":[91],"store":[92],"intermediate":[93],"paths":[94],"generated":[95],"during":[96],"computation.":[97],"For":[98],"each":[99],"shared":[100],"queue,":[101],"multiple":[102],"worker":[103],"threads":[104,117,152],"equipped":[105],"local":[107],"queues":[108],"are":[109,118],"launched":[110],"concurrently":[112],"process":[113],"paths.":[114],"Additionally,":[115],"dedicated":[116],"assigned":[119],"the":[122,157,162],"path-sets":[123],"of":[124,159],"specific":[125,154],"nodes,":[126],"achieving":[127],"lock-free":[128],"operations":[129],"avoiding":[131],"thread":[132],"conflicts.":[133],"Experimental":[134],"results":[135],"demonstrate":[136],"our":[138],"method":[139],"achieves":[140],"approximately":[141],"40-fold":[142],"60-fold":[144],"speedups":[145],"over":[146],"state-of-the-art":[147],"approaches":[148],"when":[149],"using":[150],"100":[151],"topologies":[155],"criteria.":[160],"Furthermore,":[161],"proposed":[163],"can":[165],"be":[166],"generalized":[167],"accelerate":[169],"other":[170],"label-correcting":[171],"algorithms,":[172],"providing":[173],"new":[174],"insights":[175],"into":[176],"research.":[181]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-03-20T00:00:00"}