{"id":"https://openalex.org/W2433134997","doi":"https://doi.org/10.1109/ondm.2016.7494087","title":"Adapted and constrained Dijkstra for elastic optical networks","display_name":"Adapted and constrained Dijkstra for elastic optical networks","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2433134997","doi":"https://doi.org/10.1109/ondm.2016.7494087","mag":"2433134997"},"language":"en","primary_location":{"id":"doi:10.1109/ondm.2016.7494087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ondm.2016.7494087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Optical Network Design and Modeling (ONDM)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1904.06994","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025696272","display_name":"Ireneusz Szcze\u015bniak","orcid":"https://orcid.org/0000-0002-5760-5022"},"institutions":[{"id":"https://openalex.org/I686019","display_name":"AGH University of Krakow","ror":"https://ror.org/00bas1c41","country_code":"PL","type":"education","lineage":["https://openalex.org/I686019"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Ireneusz Szczesniak","raw_affiliation_strings":["Department of Telecommunications, AGH University of Science and Technology, Krakow, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Telecommunications, AGH University of Science and Technology, Krakow, Poland","institution_ids":["https://openalex.org/I686019"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040200686","display_name":"Bo\u017cena Wo\u017ana-Szcze\u015bniak","orcid":"https://orcid.org/0000-0002-1486-6572"},"institutions":[{"id":"https://openalex.org/I4210137370","display_name":"Institute of Mathematics","ror":"https://ror.org/04hrrh248","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210137370","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Bozena Wozna-Szczesniak","raw_affiliation_strings":["Faculty of Mathematics and Natural Sciences, Institute of Mathematics and Computer Science, Cz\u0119stochowa, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Natural Sciences, Institute of Mathematics and Computer Science, Cz\u0119stochowa, Poland","institution_ids":["https://openalex.org/I4210137370"]}]}],"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":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998000264167786,"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.9998000264167786,"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.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"}},{"id":"https://openalex.org/T11429","display_name":"Semiconductor Lasers and Optical Devices","score":0.9807999730110168,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8096597194671631},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.7254224419593811},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6982922554016113},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6783779263496399},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6597847938537598},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6244972944259644},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.6188341975212097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5054507255554199},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46221843361854553},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4115092158317566},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39558398723602295},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35173261165618896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29500994086265564},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11684930324554443}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8096597194671631},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.7254224419593811},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6982922554016113},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6783779263496399},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6597847938537598},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6244972944259644},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.6188341975212097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5054507255554199},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46221843361854553},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4115092158317566},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39558398723602295},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35173261165618896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29500994086265564},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11684930324554443}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ondm.2016.7494087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ondm.2016.7494087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Optical Network Design and Modeling (ONDM)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1904.06994","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1904.06994","pdf_url":"https://arxiv.org/pdf/1904.06994","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1904.06994","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1904.06994","pdf_url":"https://arxiv.org/pdf/1904.06994","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1977313940","https://openalex.org/W1977545325","https://openalex.org/W2000215674","https://openalex.org/W2041054319","https://openalex.org/W2109329702","https://openalex.org/W4213060235"],"related_works":["https://openalex.org/W4253588386","https://openalex.org/W2810620529","https://openalex.org/W2381419702","https://openalex.org/W1562631103","https://openalex.org/W1508906807","https://openalex.org/W2147862592","https://openalex.org/W2348177054","https://openalex.org/W4285816407","https://openalex.org/W2382831994","https://openalex.org/W2578319993"],"abstract_inverted_index":{"We":[0,104,122],"present":[1],"an":[2,13,20],"optimal":[3],"and":[4,36,39,70,78,106,111,131,134,165],"efficient":[5],"algorithm":[6,18,75,109,146],"for":[7,57,65,128],"finding":[8],"a":[9,40,62,81,141,158],"shortest":[10,25,163,169],"path":[11,26,44],"in":[12,52,101],"elastic":[14],"optical":[15],"network.":[16],"The":[17,46,74],"is":[19,76],"adaptation":[21,47],"of":[22,80,92,139,156],"the":[23,33,43,49,53,89,108,118,137,144,154,161,166],"Dijkstra":[24,54],"algorithm,":[27,55],"where":[28],"we":[29],"take":[30],"into":[31],"account":[32],"spectrum":[34,83],"continuity":[35],"contiguity":[37],"constraints,":[38],"limit":[41],"on":[42],"length.":[45],"redefines":[48],"node":[50],"label":[51],"allows":[56],"revisiting":[58],"nodes":[59],"even":[60,149],"at":[61],"higher":[63],"cost":[64],"different":[66],"slices,":[67],"avoids":[68],"loops,":[69],"prunes":[71],"worse":[72],"labels.":[73],"generic":[77],"agnostic":[79],"specific":[82],"allocation":[84],"policy,":[85],"as":[86,151,153],"it":[87],"finds":[88],"largest":[90],"set":[91],"available":[93],"slices":[94,97],"from":[95],"which":[96],"can":[98,147],"be":[99,148],"allocated":[100],"any":[102],"way.":[103],"describe":[105],"motivate":[107],"design,":[110],"point":[112],"to":[113],"our":[114],"freely-available":[115],"implementation":[116],"using":[117,143,160],"Boost":[119],"Graph":[120],"Library.":[121],"carried":[123],"out":[124],"8100":[125],"simulation":[126],"runs":[127],"large,":[129],"random":[130],"realistic":[132],"networks,":[133],"found":[135],"that":[136],"probability":[138,155],"establishing":[140,157],"connection":[142,159],"proposed":[145],"twice":[150],"large":[152],"edge-disjoint":[162],"paths,":[164],"Yen":[167],"K":[168],"paths.":[170]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}