{"id":"https://openalex.org/W4414535365","doi":"https://doi.org/10.1109/icc52391.2025.11160785","title":"PVD: An Efficient Routing Algorithm for Optical Networks with Instantaneous Demands","display_name":"PVD: An Efficient Routing Algorithm for Optical Networks with Instantaneous Demands","publication_year":2025,"publication_date":"2025-06-08","ids":{"openalex":"https://openalex.org/W4414535365","doi":"https://doi.org/10.1109/icc52391.2025.11160785"},"language":"en","primary_location":{"id":"doi:10.1109/icc52391.2025.11160785","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc52391.2025.11160785","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/A5100627106","display_name":"Hao Shi","orcid":"https://orcid.org/0000-0003-0184-2245"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hao Shi","raw_affiliation_strings":["Tsinghua University,Department of Mathematics Sciences,Beijing,China"],"affiliations":[{"raw_affiliation_string":"Tsinghua University,Department of Mathematics Sciences,Beijing,China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100456391","display_name":"Yan Zhang","orcid":"https://orcid.org/0000-0003-2142-5094"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yan Zhang","raw_affiliation_strings":["Tsinghua University,Department of Mathematics Sciences,Beijing,China"],"affiliations":[{"raw_affiliation_string":"Tsinghua University,Department of Mathematics Sciences,Beijing,China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030243587","display_name":"Ming Zhang","orcid":"https://orcid.org/0000-0002-8901-7372"},"institutions":[{"id":"https://openalex.org/I2250955327","display_name":"Huawei Technologies (China)","ror":"https://ror.org/00cmhce21","country_code":"CN","type":"company","lineage":["https://openalex.org/I2250955327"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhengyu Ming","raw_affiliation_strings":["Central Research Institute, 2012 Labs, Huawei Tech. Co. Ltd.,Theory Lab"],"affiliations":[{"raw_affiliation_string":"Central Research Institute, 2012 Labs, Huawei Tech. Co. Ltd.,Theory Lab","institution_ids":["https://openalex.org/I2250955327"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112333062","display_name":"Meiling Wang","orcid":"https://orcid.org/0000-0003-0737-2897"},"institutions":[{"id":"https://openalex.org/I2250955327","display_name":"Huawei Technologies (China)","ror":"https://ror.org/00cmhce21","country_code":"CN","type":"company","lineage":["https://openalex.org/I2250955327"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Meiling Wang","raw_affiliation_strings":["Central Research Institute, 2012 Labs, Huawei Tech. Co. Ltd.,Theory Lab"],"affiliations":[{"raw_affiliation_string":"Central Research Institute, 2012 Labs, Huawei Tech. Co. Ltd.,Theory Lab","institution_ids":["https://openalex.org/I2250955327"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100627106"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27767781,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2224","last_page":"2229"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"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.9998999834060669,"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/T10232","display_name":"Optical Network Technologies","score":0.994700014591217,"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/T10767","display_name":"Advanced Photonic Communication Systems","score":0.9922999739646912,"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/speedup","display_name":"Speedup","score":0.8883000016212463},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.6245999932289124},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6057000160217285},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46860000491142273},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.40549999475479126},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.33570000529289246},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.31859999895095825},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.30959999561309814}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8883000016212463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6899999976158142},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6245999932289124},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6057000160217285},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46860000491142273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46160000562667847},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.40549999475479126},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3409000039100647},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.33570000529289246},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.31859999895095825},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.3066999912261963},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.30070000886917114},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2858999967575073},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.2777999937534332},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.2770000100135803},{"id":"https://openalex.org/C129404179","wikidata":"https://www.wikidata.org/wiki/Q1469765","display_name":"Optical communication","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.2581999897956848},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25780001282691956}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc52391.2025.11160785","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc52391.2025.11160785","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":11,"referenced_works":["https://openalex.org/W2043496413","https://openalex.org/W2064362754","https://openalex.org/W2123006588","https://openalex.org/W2147616378","https://openalex.org/W2499360023","https://openalex.org/W2769416061","https://openalex.org/W2896041704","https://openalex.org/W3174852697","https://openalex.org/W4253259245","https://openalex.org/W4398209590","https://openalex.org/W4403210169"],"related_works":[],"abstract_inverted_index":{"To":[0,43],"overcome":[1],"the":[2,71,79,82,112,117,133,141],"wastage":[3],"of":[4,18,78,81,87,128],"resources":[5],"on":[6,56,146],"recalculation":[7],"when":[8],"instantaneous":[9],"demands":[10],"are":[11,90],"ubiquitous":[12],"in":[13,116,126],"optical":[14,73],"networks,":[15],"it":[16],"is":[17],"profound":[19],"import":[20],"for":[21,70,98,135],"operators":[22],"to":[23],"engender":[24],"a":[25,34,50,65,95],"cost-effective":[26],"algorithm.":[27],"We":[28],"characterize":[29],"this":[30,45],"new":[31,96],"scenario":[32],"as":[33],"mathematical":[35],"problem":[36],"with":[37],"multiple":[38,41],"constraints":[39],"and":[40,84,108,119,138],"demands.":[42],"tackle":[44],"optimization":[46],"problem,":[47],"we":[48,93,110],"propose":[49],"novel":[51],"optimal":[52,72],"routing":[53],"algorithm":[54,83,131,142],"based":[55],"Dijkstra's":[57],"algorithm,":[58],"which":[59],"encompasses":[60],"two":[61],"subroutines:":[62],"1)":[63],"construct":[64],"virtual":[66],"graph;":[67],"2)":[68],"search":[69],"link.":[74],"A":[75],"theoretical":[76],"proof":[77],"optimality":[80],"an":[85],"analysis":[86],"its":[88],"complexity":[89],"given.":[91],"Furthermore,":[92],"release":[94],"dataset":[97,118],"follow-up":[99],"research.":[100],"By":[101],"conducting":[102],"numerous":[103],"simulations":[104],"at":[105],"different":[106],"scales":[107],"settings,":[109],"demonstrate":[111],"improvement":[113],"(62.5\u00d7":[114],"speedup":[115,125],"<tex":[120],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[121],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$1.3":[122],"\\mathrm{x}-31.22":[123],"\\mathrm{x}$</tex>":[124],"simulation)":[127],"our":[129],"proposed":[130],"over":[132],"state-of-the-art":[134],"computational":[136],"time":[137],"find":[139],"that":[140],"still":[143],"performs":[144],"well":[145],"large-scale":[147],"problems.":[148]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}