{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:41:09Z","timestamp":1742395269756,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/nca.2018.8548339","type":"proceedings-article","created":{"date-parts":[[2018,11,29]],"date-time":"2018-11-29T23:47:51Z","timestamp":1543535271000},"page":"1-4","source":"Crossref","is-referenced-by-count":5,"title":["On the Consistent Migration of Splittable Flows: Latency-Awareness and Complexities"],"prefix":"10.1109","author":[{"given":"Klaus-Tycho","family":"Foerster","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2016.7568583"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1990","author":"garey","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IFIPNetworking.2016.7497232"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524332"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2015.33"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2016.09.012"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3143361.3143397"},{"key":"ref17","article-title":"Timed consistent network updates","author":"mizrahi","year":"2015","journal-title":"Proc of ACM SOSR"},{"key":"ref18","article-title":"Congestion-free rerouting of flows on dags","author":"amiri","year":"2018","journal-title":"Proc ICALP"},{"key":"ref19","article-title":"Short schedules for fast flow rerouting","volume":"1805","author":"amiri","year":"2018","journal-title":"CoRR"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2760146"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2535771.2535791"},{"journal-title":"Don't disturb my flows Algorithms for consistent network updates in software defined networks","year":"2016","author":"foerster","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2018.00012"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836091"},{"journal-title":"Introduction to Algorithms (3 Ed )","year":"2009","author":"cormen","key":"ref7"},{"key":"ref2","article-title":"Survey of consistent network updates","volume":"1609","author":"foerster","year":"2018","journal-title":"CoRR"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626307"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342427"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2017.8171348"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1109\/TNET.2018.2871023","article-title":"Transiently policy-compliant network updates","author":"ludwig","year":"2018","journal-title":"IEEE\/ACM Trans Netw"}],"event":{"name":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","start":{"date-parts":[[2018,11,1]]},"location":"Cambridge, MA","end":{"date-parts":[[2018,11,3]]}},"container-title":["2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8533540\/8548052\/08548339.pdf?arnumber=8548339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T03:15:23Z","timestamp":1643253323000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8548339\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/nca.2018.8548339","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}