{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T06:47:00Z","timestamp":1778654820275,"version":"3.51.4"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61571136"],"award-info":[{"award-number":["61571136"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012164","name":"863 Program","doi-asserted-by":"crossref","award":["2015AA016106"],"award-info":[{"award-number":["2015AA016106"]}],"id":[{"id":"10.13039\/501100012164","id-type":"DOI","asserted-by":"crossref"}]},{"name":"European Union\u2019s Horizon 2020 MSCA COSAFE Project","award":["824019"],"award-info":[{"award-number":["824019"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Select. Areas Commun."],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1109\/jsac.2019.2927098","type":"journal-article","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T18:53:17Z","timestamp":1562525597000},"page":"1755-1768","source":"Crossref","is-referenced-by-count":42,"title":["Efficient Recovery Path Computation for Fast Reroute in Large-Scale Software-Defined Networks"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4873-0614","authenticated-orcid":false,"given":"Kun","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9807-2648","authenticated-orcid":false,"given":"Jin","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8012-4753","authenticated-orcid":false,"given":"Xiaoming","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6129-0676","authenticated-orcid":false,"given":"Stefano","family":"Secci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1","article-title":"CORONET: Fault tolerance for software defined networks","author":"kim","year":"2012","journal-title":"Proc IEEE ICNP"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3209"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.12.015"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959899"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/WoWMoM.2014.6918985"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3469"},{"key":"ref36","year":"2019","journal-title":"CAIDA"},{"key":"ref35","year":"2019","journal-title":"Topology Zoo"},{"key":"ref34","first-page":"2","article-title":"Efficient top-k shortest-path distance queries on large networks by pruned landmark labeling","author":"akiba","year":"2015","journal-title":"Proc AAAI"},{"key":"ref28","first-page":"881","article-title":"Fast reroute paths algorithms","volume":"52","author":"jarry","year":"2013","journal-title":"Telecomm Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2013.6761297"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2620728.2620744"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486019"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/WoWMoM.2014.6918980"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/nem.1957"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN.2015.7148981"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2016.11.017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342414"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/NETSOFT.2018.8459923"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2719862"},{"key":"ref50","year":"2019","journal-title":"Fast Reroute Source Code"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ICECT.2009.21"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2790008"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/EWSDN.2014.13"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2013.6461198"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098856"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.17487\/rfc4090"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.17487\/rfc5714"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.17487\/rfc5286"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2890955.2890957"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2016.7510886"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2620728.2620746"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2491185.2491187"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018477"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2015.02.014"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN.2011.6076886"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.902727"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5683637"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2123916"},{"key":"ref49","volume":"6","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.09.010"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/NFV-SDN.2016.7919495"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2012.09.011"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2016.7474344"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2619287.2619303"},{"key":"ref44","article-title":"Scaling-up flow path computation for a large number of virtual SDN\/NFV infrastructures","author":"yamanaka","year":"2015","journal-title":"Proc ACM SIGCOMM SOSR"},{"key":"ref43","year":"2016","journal-title":"CPU Benchmark Database"}],"container-title":["IEEE Journal on Selected Areas in Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/49\/8789576\/08756109.pdf?arnumber=8756109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:09:16Z","timestamp":1657746556000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8756109\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":51,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/jsac.2019.2927098","relation":{},"ISSN":["0733-8716","1558-0008"],"issn-type":[{"value":"0733-8716","type":"print"},{"value":"1558-0008","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}