{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:41:36Z","timestamp":1740148896836,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2017ZX01030301"],"award-info":[{"award-number":["2017ZX01030301"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s12083-022-01334-3","type":"journal-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T12:07:54Z","timestamp":1654862874000},"page":"2057-2078","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient loop detection and congestion-free network update for SDN"],"prefix":"10.1007","volume":"15","author":[{"given":"Dong","family":"Liang","sequence":"first","affiliation":[]},{"given":"Qinrang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Binghao","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Ting","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xingyu","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"1334_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100386","volume":"40","author":"B Yan","year":"2021","unstructured":"Yan B, Liu Q, Shen JL et al (2021) A survey of low-latency transmission strategies in software defined networking. Computer Science Review 40:100386","journal-title":"Computer Science Review"},{"key":"1334_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.comnet.2017.08.008","volume":"127","author":"DS Marcon","year":"2017","unstructured":"Marcon DS, Mazzola FM, Barcellos MP (2017) Achieving minimum bandwidth guarantees and work-conservation in large-scale, SDN-based datacenter networks. Comput Netw 127:109\u2013125","journal-title":"Comput Netw"},{"key":"1334_CR3","doi-asserted-by":"crossref","unstructured":"Michel O, Keller E (2017) SDN in wide-area networks: a survey. In 2017 Fourth International Conference on Software Defined Systems (SDS). IEEE, pp 37\u201342","DOI":"10.1109\/SDS.2017.7939138"},{"key":"1334_CR4","doi-asserted-by":"crossref","unstructured":"Caria M, Jukan A, Hoffmann M (2013) A performance study of network migration to SDN-enabled traffic engineering. In 2013 IEEE Global Communications Conference (GLOBECOM). IEEE, pp 1391\u20131396","DOI":"10.1109\/GLOCOM.2013.6831268"},{"key":"1334_CR5","doi-asserted-by":"crossref","unstructured":"Li D, Dai N, Li F et al (2017) Estimating SDN traffic matrix based on online informative flow measurement method. In 2017 Fifth International Conference on Advanced Cloud and Big Data (CBD). IEEE, pp 75\u201380","DOI":"10.1109\/CBD.2017.21"},{"key":"1334_CR6","doi-asserted-by":"crossref","unstructured":"Kurimoto T, Urushidani S, Yamada H et al (2017) SINET5: a low-latency and high-bandwidth backbone network for SDN\/NFV Era. In 2017 IEEE International Conference on Communications (ICC). IEEE, pp 1\u20137","DOI":"10.1109\/ICC.2017.7996843"},{"issue":"1","key":"1334_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/MNET.2015.7018203","volume":"29","author":"CF Lai","year":"2015","unstructured":"Lai CF, Hwang RH, Chao HC et al (2015) A buffer-aware HTTP live streaming approach for SDN-enabled 5G wireless networks. IEEE Netw 29(1):49\u201355","journal-title":"IEEE Netw"},{"issue":"9","key":"1334_CR8","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/MCOM.2017.1700041","volume":"55","author":"PK Sharma","year":"2017","unstructured":"Sharma PK, Singh S, Jeong YS et al (2017) Distblocknet: a distributed blockchains-based secure sdn architecture for iot networks. IEEE Commun Mag 55(9):78\u201385","journal-title":"IEEE Commun Mag"},{"key":"1334_CR9","doi-asserted-by":"crossref","unstructured":"Adil M, Song H, Ali J et al (2021) EnhancedAODV: a robust three phase priority-based traffic load balancing scheme for Internet of Things. IEEE Internet Things J","DOI":"10.1109\/JIOT.2021.3072984"},{"issue":"3","key":"1334_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TCE.2020.2987433","volume":"66","author":"P Chanak","year":"2020","unstructured":"Chanak P, Banerjee I (2020) Congestion free routing mechanism for IoT-enabled wireless sensor networks for smart healthcare applications. IEEE Trans Consum Electron 66(3):223\u2013232","journal-title":"IEEE Trans Consum Electron"},{"issue":"4","key":"1334_CR11","doi-asserted-by":"publisher","first-page":"2155","DOI":"10.1109\/TNSE.2020.2991106","volume":"7","author":"F Naeem","year":"2020","unstructured":"Naeem F, Srivastava G, Tariq M (2020) A software defined network based fuzzy normalized neural adaptive multipath congestion control for the internet of things. IEEE Trans Netw Sci Eng 7(4):2155\u20132164","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"17","key":"1334_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/dac.3787","volume":"32","author":"A Alioua","year":"2019","unstructured":"Alioua A, Senouci SM, Sedjelmaci H et al (2019) Incentive edge caching in software-defined internet of vehicles: a Stackelberg game approach. Int J Commun Syst 32(17):e3787","journal-title":"Int J Commun Syst"},{"key":"1334_CR13","doi-asserted-by":"crossref","unstructured":"He X, Zheng J, Dai H et al (2020) Coeus: Consistent and continuous network update in software-defined networks. In IEEE INFOCOM 2020-IEEE Conference on Computer Communications. IEEE, pp 1509\u20131518","DOI":"10.1109\/INFOCOM41043.2020.9155392"},{"key":"1334_CR14","doi-asserted-by":"crossref","unstructured":"Benson T, Anand A, Akella A et al (2011) MicroTE: Fine grained traffic engineering for data centers. In Proceedings of the seventh conference on emerging networking experiments and technologies. pp 1\u201312","DOI":"10.1145\/2079296.2079304"},{"key":"1334_CR15","doi-asserted-by":"crossref","unstructured":"Xu Z, Tang J, Meng J et al (2018) Experience-driven networking: a deep reinforcement learning based approach. In IEEE INFOCOM 2018-IEEE conference on computer communications. IEEE, pp 1871\u20131879","DOI":"10.1109\/INFOCOM.2018.8485853"},{"issue":"2","key":"1334_CR16","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1109\/COMST.2018.2876749","volume":"21","author":"KT Foerster","year":"2018","unstructured":"Foerster KT, Schmid S, Vissicchio S (2018) Survey of consistent software-defined network updates. IEEE Commun Surv Tutor 21(2):1435\u20131461","journal-title":"IEEE Commun Surv Tutor"},{"key":"1334_CR17","unstructured":"Barefoot Networks (2016) The world\u2019s fastest and most programmable networks (white paper). https:\/\/barefootnetworks.com\/white-paper\/the-worlds-fastest-most-programmable-networks\/"},{"issue":"4","key":"1334_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2534169.2486019","volume":"43","author":"S Jain","year":"2013","unstructured":"Jain S, Kumar A, Mandal S et al (2013) B4: Experience with a globally-deployed software defined WAN. ACM SIGCOMM Comput Commun Rev 43(4):3\u201314","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"1334_CR19","doi-asserted-by":"crossref","unstructured":"Hong CY, Kandula S, Mahajan R et al (2013) Achieving high utilization with software-driven WAN. In Proceedings of the ACM SIGCOMM Conference on SIGCOMM. pp 15 26","DOI":"10.1145\/2534169.2486012"},{"issue":"4","key":"1334_CR20","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1145\/2740070.2626307","volume":"44","author":"X Jin","year":"2014","unstructured":"Jin X, Liu HH, Gandhi R et al (2014) Dynamic scheduling of network updates. ACM SIGCOMM Comput Commun Rev 44(4):539\u2013550","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"issue":"9","key":"1334_CR21","doi-asserted-by":"publisher","first-page":"3974","DOI":"10.1109\/TCOMM.2018.2825425","volume":"66","author":"I Maity","year":"2018","unstructured":"Maity I, Mondal A, Misra S et al (2018) CURE: Consistent update with redundancy reduction in SDN[J]. IEEE Trans Commun 66(9):3974\u20133981","journal-title":"IEEE Trans Commun"},{"key":"1334_CR22","doi-asserted-by":"crossref","unstructured":"Wang W, He W, Su J et al (2016) Cupid: Congestion-free consistent data plane update in software defined networks. In IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications. IEEE, pp 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524420"},{"issue":"3","key":"1334_CR23","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1109\/JSAC.2018.2815458","volume":"36","author":"KR Wu","year":"2018","unstructured":"Wu KR, Liang JM, Lee SC et al (2018) Efficient and consistent flow update for software defined networks. IEEE J Sel Areas Commun 36(3):411\u2013421","journal-title":"IEEE J Sel Areas Commun"},{"key":"1334_CR24","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/j.future.2019.03.030","volume":"97","author":"P Li","year":"2019","unstructured":"Li P, Guo S, Pan C et al (2019) Fast congestion-free consistent flow forwarding rules update in software defined networking. Futur Gener Comput Syst 97:743\u2013754","journal-title":"Futur Gener Comput Syst"},{"issue":"2","key":"1334_CR25","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1109\/TNET.2018.2810640","volume":"26","author":"A Basta","year":"2018","unstructured":"Basta A, Blenk A, Dudycz S et al (2018) Efficient loop-free rerouting of multiple SDN flows. IEEE\/ACM Trans Netw 26(2):948\u2013961","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"5","key":"1334_CR26","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1109\/JSAC.2019.2906741","volume":"37","author":"J Zheng","year":"2019","unstructured":"Zheng J, Li B, Tian C et al (2019) Congestion-free rerouting of multiple flows in timed sdns. IEEE J Sel Areas Commun 37(5):968\u2013981","journal-title":"IEEE J Sel Areas Commun"},{"issue":"9","key":"1334_CR27","first-page":"2617","volume":"43","author":"SHI Jiugen","year":"2021","unstructured":"Jiugen SHI, Xu Y, Yali LIU et al (2021) Fast and consistent flow update in software defined network. J Electron Inf Technol 43(9):2617\u20132623","journal-title":"J Electron Inf Technol"},{"issue":"10","key":"1334_CR28","doi-asserted-by":"publisher","first-page":"6822","DOI":"10.1109\/TCOMM.2021.3093929","volume":"69","author":"X He","year":"2021","unstructured":"He X, Zheng J, Dai H et al (2021) Buffer-assisted network updates in timed SDN. IEEE Trans Commun 69(10):6822\u20136837","journal-title":"IEEE Trans Commun"},{"key":"1334_CR29","doi-asserted-by":"crossref","unstructured":"Wang L, Li Q, Liu Y et al (2018) Simplifying network updates in SDN and NFV networks using GUM. In 2018 27th International Conference on Computer Communication and Networks (ICCCN). IEEE, pp 1\u20139","DOI":"10.1109\/ICCCN.2018.8487365"},{"key":"1334_CR30","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.comcom.2018.02.015","volume":"120","author":"T Liu","year":"2018","unstructured":"Liu T, Liu CH, Wang W et al (2018) USA: Faster update for SDN-based internet of things sensory environments. Comput Commun 120:80\u201392","journal-title":"Comput Commun"},{"key":"1334_CR31","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.comnet.2019.03.009","volume":"155","author":"R Sukapuram","year":"2019","unstructured":"Sukapuram R, Barua G (2019) Ppcu: Proportional per-packet consistent updates for sdns using data plane time stamps. Comput Netw 155:72\u201386","journal-title":"Comput Netw"},{"key":"1334_CR32","doi-asserted-by":"crossref","unstructured":"Wu G, Gao X, Chen T et al (2018) Shifter: a consistent multicast routing update scheme in software-defined networks. In 2018 IEEE 26th International Conference on Network Protocols (ICNP). IEEE, pp 346\u2013355","DOI":"10.1109\/ICNP.2018.00050"},{"issue":"1","key":"1334_CR33","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"DB Johnson","year":"1975","unstructured":"Johnson DB (1975) Finding all the elementary circuits of a directed graph. SIAM J Comput 4(1):77\u201384","journal-title":"SIAM J Comput"},{"key":"1334_CR34","unstructured":"Open Networking Fundation: The specification of SDN.\nhttps:\/\/opennetworking.org\/wp-content\/uploads\/2013\/04\/openflow-spec-v1.3.1.pdf"},{"key":"1334_CR35","unstructured":"Global SDN Certified Testing Center. https:\/\/www.sdnctc.com\/"},{"issue":"2","key":"1334_CR36","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146\u2013160","journal-title":"SIAM J Comput"},{"key":"1334_CR37","doi-asserted-by":"crossref","unstructured":"Christensen N et al (2021) Latte: Improving the latency of transiently consistent network update schedules. ACM SIGMETRICS Perform Eval Rev 48(3):14\u201326","DOI":"10.1145\/3453953.3453957"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-022-01334-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-022-01334-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-022-01334-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T12:31:42Z","timestamp":1656765102000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-022-01334-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1334"],"URL":"https:\/\/doi.org\/10.1007\/s12083-022-01334-3","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"type":"print","value":"1936-6442"},{"type":"electronic","value":"1936-6450"}],"subject":[],"published":{"date-parts":[[2022,6,10]]},"assertion":[{"value":"12 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interests"}}]}}