{"id":"https://openalex.org/W4401508028","doi":"https://doi.org/10.1109/infocom52122.2024.10621077","title":"Fast Algorithms for Loop-Free Network Updates using Linear Programming and Local Search","display_name":"Fast Algorithms for Loop-Free Network Updates using Linear Programming and Local Search","publication_year":2024,"publication_date":"2024-05-20","ids":{"openalex":"https://openalex.org/W4401508028","doi":"https://doi.org/10.1109/infocom52122.2024.10621077"},"language":"en","primary_location":{"id":"doi:10.1109/infocom52122.2024.10621077","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/infocom52122.2024.10621077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2024 - IEEE Conference on Computer 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/A5016682913","display_name":"Harald R\u00e4cke","orcid":"https://orcid.org/0000-0001-8797-717X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Harald R\u00e4cke","raw_affiliation_strings":["TU Munich"],"affiliations":[{"raw_affiliation_string":"TU Munich","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066080641","display_name":"Stefan Schmid","orcid":"https://orcid.org/0000-0002-7798-1711"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Schmid","raw_affiliation_strings":["TU Berlin"],"affiliations":[{"raw_affiliation_string":"TU Berlin","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5093234942","display_name":"Radu Vintan","orcid":"https://orcid.org/0009-0000-6713-7253"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Radu Vintan","raw_affiliation_strings":["EPFL"],"affiliations":[{"raw_affiliation_string":"EPFL","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016682913"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13393957,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1930","last_page":"1939"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":1.0,"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/T10714","display_name":"Software-Defined Networks and 5G","score":1.0,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9993000030517578,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/computer-science","display_name":"Computer science","score":0.7010365128517151},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6571388244628906},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.6154932975769043},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.504348635673523},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.41337957978248596},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3340336084365845},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1697016954421997}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7010365128517151},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6571388244628906},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.6154932975769043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.504348635673523},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.41337957978248596},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3340336084365845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1697016954421997},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom52122.2024.10621077","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/infocom52122.2024.10621077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2024 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W158224344","https://openalex.org/W1714884520","https://openalex.org/W1964393599","https://openalex.org/W2040340473","https://openalex.org/W2058503096","https://openalex.org/W2068384525","https://openalex.org/W2091307059","https://openalex.org/W2120900812","https://openalex.org/W2137826183","https://openalex.org/W2138743329","https://openalex.org/W2162547852","https://openalex.org/W2383862330","https://openalex.org/W2426667934","https://openalex.org/W2470756317","https://openalex.org/W2527860649","https://openalex.org/W2774472794","https://openalex.org/W2786499672","https://openalex.org/W2808275500","https://openalex.org/W2914189542","https://openalex.org/W2982500848","https://openalex.org/W2995646049","https://openalex.org/W2997288271","https://openalex.org/W3037981738","https://openalex.org/W3103142336","https://openalex.org/W3134208165","https://openalex.org/W3166300667","https://openalex.org/W3187890719","https://openalex.org/W4285210891","https://openalex.org/W4285214247","https://openalex.org/W4286571694","https://openalex.org/W4382401951","https://openalex.org/W6606536520","https://openalex.org/W6635205284"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W24774503","https://openalex.org/W2014821076","https://openalex.org/W1990620319","https://openalex.org/W1965744717","https://openalex.org/W2111234595","https://openalex.org/W2053286651","https://openalex.org/W2952680837","https://openalex.org/W1895669308"],"abstract_inverted_index":{"To":[0],"meet":[1],"stringent":[2],"performance":[3,118],"requirements,":[4],"communication":[5],"networks":[6,20],"are":[7,83],"becoming":[8],"increasingly":[9],"programmable":[10],"and":[11,15,24,60,74,120,140,198],"flexible,":[12],"supporting":[13],"fast":[14,68],"frequent":[16],"adjustments.":[17],"However,":[18],"reconfiguring":[19],"in":[21,46,49,183],"a":[22,47,50,86,99,107,144,151,187],"dependable":[23],"transiently":[25],"consistent":[26],"manner":[27],"is":[28,106,147],"known":[29],"to":[30,42,70,79,95,189],"be":[31,93,159],"algorithmically":[32],"challenging.":[33],"This":[34],"paper":[35],"revisits":[36],"the":[37,44,56,61,72,122,162,165,176,180,184,190],"fundamental":[38],"problem":[39,76],"of":[40,129,179],"how":[41],"update":[43,156,177],"routes":[45],"network":[48],"(transiently)":[51],"loop-free":[52],"manner,":[53],"considering":[54],"both":[55],"Strong":[57],"Loop-Freedom":[58,63],"(SLF)":[59],"Relaxed":[62],"(RLF)":[64],"property.We":[65],"present":[66],"two":[67],"algorithms":[69,82,125,139],"solve":[71,96],"SLF":[73],"RLF":[75],"variants":[77],"exactly,":[78],"optimality.":[80],"Our":[81,102],"based":[84],"on":[85,131],"parameterized":[87],"integer":[88],"linear":[89],"program":[90],"which":[91],"would":[92],"intractable":[94],"directly":[97],"by":[98,113,126],"classic":[100],"solver.":[101],"main":[103],"technical":[104],"contribution":[105,188],"lazy":[108],"cycle":[109],"breaking":[110],"strategy":[111],"which,":[112],"adding":[114],"constraints":[115],"lazily,":[116],"improves":[117],"dramatically,":[119],"outperforms":[121],"state-of-the-art":[123,163,181],"exact":[124],"an":[127,171],"order":[128],"magnitude":[130],"realistic":[132],"medium-sized":[133],"networks.":[134],"We":[135],"further":[136],"explore":[137],"approximate":[138],"show":[141],"that":[142],"while":[143],"relaxation":[145],"approach":[146,154],"relatively":[148],"slow,":[149],"with":[150],"local":[152],"search":[153],"short":[155],"schedules":[157],"can":[158],"found,":[160],"outperforming":[161],"heuristics.On":[164],"theoretical":[166],"front,":[167],"we":[168,193],"also":[169],"provide":[170],"approximation":[172],"lower":[173],"bound":[174],"for":[175],"time":[178],"algorithm":[182],"literature.":[185],"As":[186],"research":[191],"community,":[192],"made":[194],"all":[195],"our":[196],"code":[197],"implementations":[199],"publicly":[200],"available.":[201]},"counts_by_year":[],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}