{"id":"https://openalex.org/W4414538499","doi":"https://doi.org/10.1109/icc52391.2025.11160752","title":"Traffic Engineering in Quantum Networks: A Caching-Enabled Approach to Entanglement Routing","display_name":"Traffic Engineering in Quantum Networks: A Caching-Enabled Approach to Entanglement Routing","publication_year":2025,"publication_date":"2025-06-08","ids":{"openalex":"https://openalex.org/W4414538499","doi":"https://doi.org/10.1109/icc52391.2025.11160752"},"language":"en","primary_location":{"id":"doi:10.1109/icc52391.2025.11160752","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc52391.2025.11160752","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2025 - IEEE International Conference on Communications","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/A5067807482","display_name":"Wan-Ting Ho","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Wan-Ting Ho","raw_affiliation_strings":["National Tsing Hua University,Dept. of Computer Science,Hsinchu,Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Tsing Hua University,Dept. of Computer Science,Hsinchu,Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088149965","display_name":"Wei-Chia Hsieh","orcid":null},"institutions":[{"id":"https://openalex.org/I148099254","display_name":"National Chung Cheng University","ror":"https://ror.org/0028v3876","country_code":"TW","type":"education","lineage":["https://openalex.org/I148099254"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Wei-Chia Hsieh","raw_affiliation_strings":["National Chung Cheng University,Dept. of Computer Science and Information Engineering,Chiayi,Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Chung Cheng University,Dept. of Computer Science and Information Engineering,Chiayi,Taiwan","institution_ids":["https://openalex.org/I148099254"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000619887","display_name":"Lifeng Chen","orcid":"https://orcid.org/0000-0003-2580-928X"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Li-Feng Chen","raw_affiliation_strings":["National Tsing Hua University,Dept. of Computer Science,Hsinchu,Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Tsing Hua University,Dept. of Computer Science,Hsinchu,Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047093422","display_name":"Jian-Jhih Kuo","orcid":"https://orcid.org/0000-0002-1051-5089"},"institutions":[{"id":"https://openalex.org/I148099254","display_name":"National Chung Cheng University","ror":"https://ror.org/0028v3876","country_code":"TW","type":"education","lineage":["https://openalex.org/I148099254"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Jian-Jhih Kuo","raw_affiliation_strings":["National Chung Cheng University,Dept. of Computer Science and Information Engineering,Chiayi,Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Chung Cheng University,Dept. of Computer Science and Information Engineering,Chiayi,Taiwan","institution_ids":["https://openalex.org/I148099254"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067572713","display_name":"Shing-Yan Fang","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Shing-Yan Fang","raw_affiliation_strings":["National Tsing Hua University,Dept. of Computer Science,Hsinchu,Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Tsing Hua University,Dept. of Computer Science,Hsinchu,Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110831171","display_name":"Ming-Jer Tsai","orcid":"https://orcid.org/0009-0007-3561-3295"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Ming-Jer Tsai","raw_affiliation_strings":["National Tsing Hua University,Dept. of Computer Science,Hsinchu,Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Tsing Hua University,Dept. of Computer Science,Hsinchu,Taiwan","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"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.122755,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5325","last_page":"5330"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T13182","display_name":"Quantum-Dot Cellular Automata","score":0.9794999957084656,"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"}},{"id":"https://openalex.org/T13052","display_name":"Molecular Communication and Nanonetworks","score":0.9287999868392944,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/routing","display_name":"Routing (electronic design automation)","score":0.6908000111579895},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.54830002784729},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.486299991607666},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.47769999504089355},{"id":"https://openalex.org/keywords/quantum-entanglement","display_name":"Quantum entanglement","score":0.4708999991416931},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.3871000111103058},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.38440001010894775},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.36390000581741333}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6908000111579895},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6814000010490417},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.54830002784729},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.486299991607666},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.47769999504089355},{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"score":0.4708999991416931},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4684999883174896},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4528000056743622},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.3871000111103058},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.38440001010894775},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.36390000581741333},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.3418999910354614},{"id":"https://openalex.org/C94600068","wikidata":"https://www.wikidata.org/wiki/Q7371621","display_name":"Routing domain","level":5,"score":0.3352000117301941},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32710000872612},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.3163999915122986},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3027999997138977},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.29829999804496765},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.2957000136375427},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.2930000126361847},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.2703000009059906},{"id":"https://openalex.org/C16160715","wikidata":"https://www.wikidata.org/wiki/Q1640676","display_name":"Traffic engineering","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.262800008058548}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc52391.2025.11160752","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc52391.2025.11160752","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2025 - IEEE International Conference on Communications","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":15,"referenced_works":["https://openalex.org/W2003762972","https://openalex.org/W2049471987","https://openalex.org/W2080553533","https://openalex.org/W2084685553","https://openalex.org/W2105808107","https://openalex.org/W2273682834","https://openalex.org/W2963893013","https://openalex.org/W3101455050","https://openalex.org/W3156680059","https://openalex.org/W3158604495","https://openalex.org/W3178307110","https://openalex.org/W3202277085","https://openalex.org/W4280646555","https://openalex.org/W4283214197","https://openalex.org/W4380763541"],"related_works":[],"abstract_inverted_index":{"With":[0],"the":[1,31,51,65,84,96,127,135],"enhanced":[2],"security":[3],"offered":[4],"by":[5,138],"quantum":[6,8],"teleportation,":[7],"networks":[9],"(QNs)":[10],"are":[11],"gradually":[12],"gaining":[13],"significant":[14],"attention.":[15],"However,":[16],"previous":[17],"research":[18],"on":[19],"QNs":[20],"often":[21],"exhausts":[22],"all":[23],"network":[24,124],"resources":[25,33],"to":[26,40,89,140],"serve":[27],"requests,":[28,121],"hence":[29],"overlooking":[30],"scarce":[32],"in":[34],"QN.":[35],"This":[36,80],"oversight":[37],"easily":[38],"leads":[39],"resource":[41,67],"wastage":[42],"and":[43,69,118],"requests":[44],"competing":[45],"for":[46,73,113],"limited":[47],"resources.":[48],"To":[49,94],"address":[50],"above":[52],"issues,":[53],"this":[54],"paper":[55],"introduces":[56],"a":[57,100],"new":[58],"optimization":[59],"problem":[60],"named":[61,103],"EINS,":[62,97],"which":[63,105],"minimizes":[64],"maximum":[66],"utilization":[68],"finds":[70],"routing":[71,85,91],"paths":[72],"each":[74],"request":[75],"through":[76],"certain":[77],"intermediate":[78],"nodes.":[79],"design":[81,99],"cleverly":[82],"divides":[83],"path":[86,92],"into":[87],"segments":[88],"enhance":[90],"diversity.":[93],"solve":[95],"we":[98],"novel":[101],"algorithm":[102],"GOAL,":[104],"provides":[106],"an":[107],"<tex":[108],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[109],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O(\\log\\vert":[110],"V\\vert)$</tex>":[111],"bound":[112],"constraint":[114],"deviation.":[115],"It":[116],"efficiently":[117],"equitably":[119],"distributes":[120],"ensuring":[122],"optimal":[123],"utilization.":[125],"Finally,":[126],"simulation":[128],"results":[129],"manifest":[130],"that":[131],"GOAL":[132],"can":[133],"outperform":[134],"existing":[136],"methods":[137],"up":[139],"99%.":[141]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}