{"id":"https://openalex.org/W4407025888","doi":"https://doi.org/10.1109/ton.2025.3534332","title":"A Simple and General Operational Framework to Deploy Optimal Routes With Source Routing","display_name":"A Simple and General Operational Framework to Deploy Optimal Routes With Source Routing","publication_year":2025,"publication_date":"2025-01-31","ids":{"openalex":"https://openalex.org/W4407025888","doi":"https://doi.org/10.1109/ton.2025.3534332"},"language":"en","primary_location":{"id":"doi:10.1109/ton.2025.3534332","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ton.2025.3534332","pdf_url":null,"source":{"id":"https://openalex.org/S5407042750","display_name":"IEEE Transactions on Networking","issn_l":"2998-4157","issn":["2998-4157"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Networking","raw_type":"journal-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/A5054863398","display_name":"Quentin Bramas","orcid":"https://orcid.org/0000-0003-0612-5616"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I68947357","display_name":"Universit\u00e9 de Strasbourg","ror":"https://ror.org/00pg6eq24","country_code":"FR","type":"education","lineage":["https://openalex.org/I68947357"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Quentin Bramas","raw_affiliation_strings":["ICube Laboratory, CNRS, University of Strasbourg, Strasbourg, France"],"raw_orcid":"https://orcid.org/0000-0003-0612-5616","affiliations":[{"raw_affiliation_string":"ICube Laboratory, CNRS, University of Strasbourg, Strasbourg, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I68947357"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049232220","display_name":"Jean-Romain Luttringer","orcid":"https://orcid.org/0000-0002-1809-7723"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I68947357","display_name":"Universit\u00e9 de Strasbourg","ror":"https://ror.org/00pg6eq24","country_code":"FR","type":"education","lineage":["https://openalex.org/I68947357"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Romain Luttringer","raw_affiliation_strings":["ICube Laboratory, CNRS, University of Strasbourg, Strasbourg, France"],"raw_orcid":"https://orcid.org/0000-0002-1809-7723","affiliations":[{"raw_affiliation_string":"ICube Laboratory, CNRS, University of Strasbourg, Strasbourg, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I68947357"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028308880","display_name":"Pascal M\u00e9rindol","orcid":"https://orcid.org/0000-0003-2750-376X"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I68947357","display_name":"Universit\u00e9 de Strasbourg","ror":"https://ror.org/00pg6eq24","country_code":"FR","type":"education","lineage":["https://openalex.org/I68947357"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Pascal M\u00e9rindol","raw_affiliation_strings":["ICube Laboratory, CNRS, University of Strasbourg, Strasbourg, France"],"raw_orcid":"https://orcid.org/0000-0003-2750-376X","affiliations":[{"raw_affiliation_string":"ICube Laboratory, CNRS, University of Strasbourg, Strasbourg, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I68947357"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0126999,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"3","first_page":"1361","last_page":"1372"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9409999847412109,"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/T12288","display_name":"Optimization and Search Problems","score":0.9409999847412109,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9405999779701233,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/T12029","display_name":"DNA and Biological Computing","score":0.9373999834060669,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.7860227823257446},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6597541570663452},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5125138759613037},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.41416698694229126},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.40414685010910034}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.7860227823257446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6597541570663452},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5125138759613037},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.41416698694229126},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40414685010910034},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ton.2025.3534332","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ton.2025.3534332","pdf_url":null,"source":{"id":"https://openalex.org/S5407042750","display_name":"IEEE Transactions on Networking","issn_l":"2998-4157","issn":["2998-4157"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Networking","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-04966794v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04966794","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE/ACM Transactions on Networking, 2025, pp.1-12. ⟨10.1109/TON.2025.3534332⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G994551061","display_name":"leveraGing programmAbility to cReate aDaptive grEen Networks","funder_award_id":"ANR-24-CE25-6318","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1595457770","https://openalex.org/W1938452546","https://openalex.org/W2035841327","https://openalex.org/W2154416792","https://openalex.org/W2467997261","https://openalex.org/W2514718641","https://openalex.org/W2566381278","https://openalex.org/W2784125112","https://openalex.org/W2896149153","https://openalex.org/W2903003182","https://openalex.org/W2919775137","https://openalex.org/W3012605227","https://openalex.org/W3043903408","https://openalex.org/W3205859612","https://openalex.org/W4247540870","https://openalex.org/W4385233802","https://openalex.org/W4386365374","https://openalex.org/W6744903136","https://openalex.org/W6761361192","https://openalex.org/W7049035697"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W1585007175","https://openalex.org/W2382521049","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2144385241","https://openalex.org/W2358668433","https://openalex.org/W4396701345"],"abstract_inverted_index":{"Source":[0],"Routing,":[1],"currently":[2],"facilitated":[3],"by":[4,52,137,173],"Segment":[5,100],"Routing":[6],"(SR),":[7],"enables":[8],"routers":[9],"to":[10,14,17,72,75,160],"add":[11],"forwarding":[12],"instructions":[13,30],"the":[15,25,39,53,56,139,143,149,167,201],"packet":[16],"follow":[18],"a":[19,32,65,88,91,181],"particular":[20,115],"path":[21,66,134,144,192],"that":[22,43,93],"deviates":[23],"from":[24],"typical":[26],"IGP":[27],"path.":[28],"These":[29],"form":[31],"list":[33],"of":[34,41,169,205],"detours":[35],"(called":[36],"segments).":[37],"However,":[38],"number":[40],"segments":[42],"can":[44],"be":[45,73],"imposed":[46],"at":[47,184],"line-rate":[48],"is":[49,71,94],"tightly":[50],"constrained":[51],"hardware.":[54],"Hence,":[55],"main":[57],"challenge":[58],"consists":[59],"in":[60,90,96,114],"incorporating":[61],"this":[62,121],"constraint":[63,141],"into":[64],"computation":[67,135,145],"algorithm.":[68],"The":[69],"goal":[70],"able":[74],"solve":[76],"many":[77],"existing":[78,97],"problems,":[79],"including":[80],"finding":[81],"multi-constrained":[82],"paths":[83],"and":[84,147,191,203,214,218,223],"re-routing":[85],"packets":[86],"after":[87],"failure,":[89],"way":[92],"deployeable":[95],"networks":[98],"using":[99],"Routing.":[101],"Existing":[102],"solutions":[103],"either":[104],"lack":[105],"generality,":[106],"correctness,":[107],"optimality,":[108],"or":[109],"practical":[110,212],"computing":[111],"efficiency":[112],"\u2013":[113],"for":[116,195,210],"sparse":[117],"realistic":[118],"networks.":[119],"In":[120],"paper,":[122],"we":[123],"address":[124],"all":[125],"such":[126],"challenges":[127],"with":[128,156],"GOFOR-SR.":[129],"Our":[130],"framework":[131,209],"extends":[132],"usual":[133],"algorithms":[136],"integrating":[138],"SR":[140],"within":[142],"itself":[146],"modifying":[148],"distance":[150],"comparison":[151],"method.":[152],"GOFOR":[153,175],"allows":[154],"algorithm":[155],"various":[157,211],"optimization":[158],"objectives":[159],"efficiently":[161],"compute":[162],"optimal":[163],"segment":[164],"lists.":[165],"Despite":[166],"loss":[168],"substructure":[170],"optimality":[171,204],"induced":[172],"SR,":[174],"proves":[176],"particularly":[177],"efficient,":[178],"inducing":[179],"only":[180],"linear":[182],"overhead":[183],"worst.":[185],"It":[186],"also":[187],"offers":[188],"different":[189],"strategies":[190],"diversity":[193],"options":[194],"intricate":[196],"load-balancing.":[197],"We":[198],"formally":[199],"prove":[200],"correctness":[202],"GOFOR,":[206],"implement":[207],"our":[208],"use-cases,":[213],"demonstrate":[215],"its":[216],"performance":[217],"benefits":[219],"on":[220],"both":[221],"real":[222],"challenging":[224],"topologies.":[225]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}