{"id":"https://openalex.org/W2519194043","doi":"https://doi.org/10.1109/icccn.2016.7568583","title":"The Power of Two in Consistent Network Updates: Hard Loop Freedom, Easy Flow Migration","display_name":"The Power of Two in Consistent Network Updates: Hard Loop Freedom, Easy Flow Migration","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2519194043","doi":"https://doi.org/10.1109/icccn.2016.7568583","mag":"2519194043"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2016.7568583","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2016.7568583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 25th International Conference on Computer Communication and Networks (ICCCN)","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/A5112483003","display_name":"Klaus-Tycho F\u00f6rster","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Klaus-Tycho Forster","raw_affiliation_strings":["ETH Zurich"],"affiliations":[{"raw_affiliation_string":"ETH Zurich","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078339613","display_name":"Roger Wattenhofer","orcid":"https://orcid.org/0000-0002-6339-3134"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Roger Wattenhofer","raw_affiliation_strings":["ETH Zurich"],"affiliations":[{"raw_affiliation_string":"ETH Zurich","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112483003"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":6.3698,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.96770852,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9998999834060669,"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":0.9998999834060669,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9976999759674072,"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/T11478","display_name":"Caching and Content Delivery","score":0.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.8496980667114258},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6834254264831543},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.6050458550453186},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5404021143913269},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5141194462776184},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4160473942756653},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4137667417526245},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3623700737953186},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3521067202091217},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32467353343963623},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21146515011787415},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11545035243034363}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.8496980667114258},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6834254264831543},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.6050458550453186},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5404021143913269},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5141194462776184},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4160473942756653},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4137667417526245},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3623700737953186},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3521067202091217},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32467353343963623},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21146515011787415},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11545035243034363},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2016.7568583","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2016.7568583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 25th International Conference on Computer Communication and Networks (ICCCN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.800000011920929,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1508068333","https://openalex.org/W1525605957","https://openalex.org/W1637524539","https://openalex.org/W1651984967","https://openalex.org/W1964393599","https://openalex.org/W1975307759","https://openalex.org/W1977543579","https://openalex.org/W1988801089","https://openalex.org/W2001276479","https://openalex.org/W2009038171","https://openalex.org/W2068384525","https://openalex.org/W2068810724","https://openalex.org/W2070745908","https://openalex.org/W2091307059","https://openalex.org/W2102090846","https://openalex.org/W2117702591","https://openalex.org/W2118382442","https://openalex.org/W2126822952","https://openalex.org/W2137826183","https://openalex.org/W2149236835","https://openalex.org/W2162547852","https://openalex.org/W2211762534","https://openalex.org/W2268311143","https://openalex.org/W2414922677","https://openalex.org/W2426667934","https://openalex.org/W2470756317","https://openalex.org/W2479920125","https://openalex.org/W2527860649","https://openalex.org/W2735337572","https://openalex.org/W3163011775","https://openalex.org/W4285719527","https://openalex.org/W6631722374","https://openalex.org/W6727822494"],"related_works":["https://openalex.org/W2387449261","https://openalex.org/W2418518962","https://openalex.org/W2769269860","https://openalex.org/W2963377682","https://openalex.org/W2391769344","https://openalex.org/W4297790016","https://openalex.org/W2359260952","https://openalex.org/W2043159103","https://openalex.org/W2388752733","https://openalex.org/W3109562497"],"abstract_inverted_index":{"We":[0,75],"study":[1,44],"complexity":[2,104],"and":[3,33,81,133],"algorithms":[4],"for":[5,21,64,69,105],"network":[6],"updates":[7,20,63],"in":[8,28],"the":[9,22,34,46,51,78,98,103,108,119,141],"setting":[10],"of":[11,24,36,48,73,100,122],"Software":[12],"Defined":[13],"Networks.":[14],"Our":[15],"focus":[16],"lies":[17],"on":[18],"consistent":[19,62],"case":[23],"updating":[25],"forwarding":[26],"rules":[27],"a":[29,70,91],"loop":[30,56,106],"free":[31],"manner":[32],"migration":[35],"flows":[37,116,126],"without":[38],"congestion.":[39],"In":[40],"both":[41],"cases,":[42],"we":[43,58,136],"how":[45],"power":[47,99],"two":[49,65,101],"affects":[50],"respective":[52],"problem":[53,85,121,142],"setting.":[54],"For":[55,118],"freedom,":[57,107],"show":[59,82],"that":[60,83,138],"scheduling":[61],"destinations":[66],"is":[67,86,110],"NP-hard":[68,87,120],"sublinear":[71],"number":[72],"rounds.":[74],"also":[76],"consider":[77],"dynamic":[79],"case,":[80],"this":[84],"as":[88],"well":[89],"via":[90],"reduction":[92],"from":[93],"Feedback":[94],"Arc":[95],"Set.":[96],"While":[97],"increases":[102],"converse":[109],"true":[111],"when":[112],"allowing":[113],"to":[114,127,143],"split":[115],"twice.":[117],"consistently":[123],"migrating":[124],"unsplittable":[125],"new":[128],"routes":[129],"while":[130],"respecting":[131],"waypointing":[132],"service":[134],"chains,":[135],"prove":[137],"two-splittability":[139],"allows":[140],"be":[144],"tractable":[145],"again.":[146]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}