{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:29:54Z","timestamp":1761611394727,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e Tecnologia through the Portuguese Ministry of Science and Higher Education","award":["UID\/EEA\/50008\/2013"],"award-info":[{"award-number":["UID\/EEA\/50008\/2013"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1109\/tnet.2016.2567600","type":"journal-article","created":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T14:06:50Z","timestamp":1465222010000},"page":"150-163","source":"Crossref","is-referenced-by-count":20,"title":["Correctness of Routing Vector Protocols as a Property of Network Cycles"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4476-100X","authenticated-orcid":false,"given":"Joao Luis","family":"Sobrinho","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916261"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/316194.316231","article-title":"An analysis of BGP convergence properties","author":"griffin","year":"1999","journal-title":"Proc ACM Sigcomm"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129126"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2165080"},{"journal-title":"Graphs and Networks","year":"1979","author":"carr\u00e9","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080094"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/11422778_52"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2070562.2070573"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2255311"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1321753.1321765"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1868447.1868450"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2333112.2333121"},{"key":"ref11","first-page":"268","article-title":"The stratified shortest-paths problem","author":"griffin","year":"2010","journal-title":"Proc Int Conf Commun Syst Netw"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/190314.190336"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015483"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.222"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00108-5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/90.993304"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482609"},{"journal-title":"Data Networks","year":"1991","author":"bertsekas","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.857111"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2187924"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2453"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2011.110311.100109"},{"article-title":"Routing design for large scale data centers: BGP is the better IGP","year":"0","author":"lahiri","key":"ref3"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/1030194.1015472","article-title":"Routing design in operational networks: A look from the inside","author":"maltz","year":"2004","journal-title":"Proc ACM Sigcomm"},{"journal-title":"Graphes Dioïdes et Semi-Anneaux Nouveaux Modeles et Algorithmes","year":"2001","author":"gondran","key":"ref29"},{"journal-title":"EIGRP for IP Basic Operation and Configuration","year":"2000","author":"retana","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402964"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2007.4375839"},{"journal-title":"Practical BGP","year":"2005","author":"white","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011770"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.17487\/rfc4271"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/90.974523"},{"key":"ref22","first-page":"547","article-title":"Inherently safe backup routing with BGP","author":"gao","year":"2001","journal-title":"Proc IEEE InfoCom"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2049858"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2106798"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566965"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2007.4375842"},{"journal-title":"Personal Site of Geoff Huston","year":"2014","author":"huston","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/505202.505207"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.896531"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2019643.2019644"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/7855841\/07485833.pdf?arnumber=7485833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:38:59Z","timestamp":1641987539000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7485833\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":43,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2016.2567600","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2017,2]]}}}