{"id":"https://openalex.org/W2771862829","doi":"https://doi.org/10.1109/nca.2017.8171348","title":"On the consistent migration of unsplittable flows: Upper and lower complexity bounds","display_name":"On the consistent migration of unsplittable flows: Upper and lower complexity bounds","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2771862829","doi":"https://doi.org/10.1109/nca.2017.8171348","mag":"2771862829"},"language":"en","primary_location":{"id":"doi:10.1109/nca.2017.8171348","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nca.2017.8171348","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 16th International Symposium on Network Computing and Applications (NCA)","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/A5085843145","display_name":"Klaus-Tycho Foerster","orcid":"https://orcid.org/0000-0003-4635-4480"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Klaus-Tycho Foerster","raw_affiliation_strings":["Aalborg University, Denmark"],"affiliations":[{"raw_affiliation_string":"Aalborg University, Denmark","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085843145"],"corresponding_institution_ids":["https://openalex.org/I891191580"],"apc_list":null,"apc_paid":null,"fwci":2.2792,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.90188944,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9973000288009644,"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.9973000288009644,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9959999918937683,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9929999709129333,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6865114569664001},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5216529965400696},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4264169931411743},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41669952869415283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2517136335372925},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07884210348129272}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6865114569664001},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5216529965400696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4264169931411743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41669952869415283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2517136335372925},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07884210348129272}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/nca.2017.8171348","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nca.2017.8171348","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 16th International Symposium on Network Computing and Applications (NCA)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/c672b4cd-6388-42c7-a49b-f94855b0b443","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/c672b4cd-6388-42c7-a49b-f94855b0b443","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"F\u00f6rster, K-T 2017, On the Consistent Migration of Unsplittable Flows : Upper and Lower Complexity Bounds. in Network Computing and Applications (NCA), 2017 IEEE 16th International Symposium on. IEEE (Institute of Electrical and Electronics Engineers), Network Computing and Applications, Cambridge, United States, 30/10/2017. https://doi.org/10.1109/NCA.2017.8171348","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.7900000214576721,"display_name":"Reduced inequalities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W1542956335","https://openalex.org/W1711499209","https://openalex.org/W1964393599","https://openalex.org/W2003160050","https://openalex.org/W2028926203","https://openalex.org/W2058503096","https://openalex.org/W2068810724","https://openalex.org/W2091307059","https://openalex.org/W2097371774","https://openalex.org/W2102090846","https://openalex.org/W2103154811","https://openalex.org/W2107997203","https://openalex.org/W2126822952","https://openalex.org/W2137826183","https://openalex.org/W2149236835","https://openalex.org/W2149804187","https://openalex.org/W2162547852","https://openalex.org/W2170644767","https://openalex.org/W2216417629","https://openalex.org/W2306851710","https://openalex.org/W2328180918","https://openalex.org/W2383862330","https://openalex.org/W2414922677","https://openalex.org/W2426667934","https://openalex.org/W2466198137","https://openalex.org/W2470756317","https://openalex.org/W2479920125","https://openalex.org/W2504195863","https://openalex.org/W2511199264","https://openalex.org/W2519194043","https://openalex.org/W2520044479","https://openalex.org/W2526308980","https://openalex.org/W2527860649","https://openalex.org/W2528855163","https://openalex.org/W2549442734","https://openalex.org/W2559548740","https://openalex.org/W2569646339","https://openalex.org/W2606825926","https://openalex.org/W2606892031","https://openalex.org/W2625782120","https://openalex.org/W2764219564","https://openalex.org/W2768610056","https://openalex.org/W2963769211","https://openalex.org/W2998113761","https://openalex.org/W3163011775","https://openalex.org/W4232250257","https://openalex.org/W4236202168","https://openalex.org/W4236835455","https://openalex.org/W4247885026","https://openalex.org/W4254057056","https://openalex.org/W6632255303","https://openalex.org/W6637264296","https://openalex.org/W6688955620","https://openalex.org/W6725591128","https://openalex.org/W6726521921","https://openalex.org/W6729254522","https://openalex.org/W6730919094"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"In":[0,138],"consistent":[1],"flow":[2,155],"migration,":[3],"the":[4,9,11,15,22,27,40,50,54,68,87,88,99,127],"task":[5],"is":[6,42,95,157],"to":[7,201],"change":[8],"paths":[10,148],"flows":[12,94,144],"take":[13],"in":[14,45,129],"network,":[16],"but":[17],"without":[18],"inducing":[19],"congestion":[20],"during":[21],"update":[23],"process.":[24],"Even":[25],"though":[26],"rise":[28],"of":[29,37,61,71,90],"Software":[30],"Defined":[31],"Networks":[32],"allows":[33],"for":[34,76,98,123,131,172,189],"centralized":[35],"control":[36],"path":[38,179],"changes,":[39],"execution":[41],"still":[43],"performed":[44],"an":[46,160],"inherently":[47],"asynchronous":[48],"system,":[49],"switches":[51],"distributed":[52],"over":[53],"network.":[55],"To":[56],"this":[57],"end,":[58],"a":[59,119],"multitude":[60],"scheduling":[62],"systems":[63],"have":[64],"been":[65],"proposed":[66],"since":[67],"initial":[69],"papers":[70],"Reitblatt":[72],"et":[73,82],"al.":[74,83],"(Abstractions":[75],"Network":[77],"Update,":[78],"SIGCOMM'12)":[79],"and":[80,111,135,150,168],"Hong":[81],"(SWAN,":[84],"SIGCOMM'13).":[85],"While":[86],"complexity":[89,113],"consistently":[91],"migrating":[92],"splittable":[93],"well":[96],"understood,":[97],"practically":[100],"more":[101],"relevant":[102],"unsplittable":[103,124],"flows,":[104,125,174],"few":[105],"non-heuristic":[106],"results":[107],"are":[108,115,141],"known":[109],"-":[110],"upper":[112],"bounds":[114,167],"missing.":[116],"We":[117,163],"give":[118],"dynamic":[120,191],"programming":[121,192],"algorithm":[122],"showing":[126,195],"containment":[128],"EXPTIME,":[130],"both":[132],"computation":[133],"time":[134],"schedule":[136],"length.":[137],"particular,":[139],"there":[140],"cases":[142,188],"where":[143],"must":[145],"switch":[146],"between":[147],"back":[149],"forth":[151],"repeatedly:":[152],"as":[153],"thus,":[154],"migration":[156],"not":[158],"just":[159],"ordering":[161],"problem.":[162],"also":[164,183],"study":[165],"lower":[166],"show":[169],"NP-hardness":[170],"already":[171],"two":[173],"via":[175],"reduction":[176],"from":[177],"edge-disjoint":[178],"problems.":[180],"Lastly,":[181],"we":[182],"discuss":[184],"some":[185],"practical":[186],"application":[187],"our":[190],"algorithm,":[193],"furthermore":[194],"how":[196],"it":[197],"can":[198],"be":[199],"extended":[200],"min-max":[202],"load":[203],"considerations.":[204]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}