{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T00:10:12Z","timestamp":1777162212734,"version":"3.51.4"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Select. Areas Commun."],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1109\/jsac.2019.2906742","type":"journal-article","created":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T19:27:46Z","timestamp":1553196466000},"page":"982-996","source":"Crossref","is-referenced-by-count":16,"title":["Scalable and Efficient Multipath Routing via Redundant Trees"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3512-9504","authenticated-orcid":false,"given":"Janos","family":"Tapolcai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5958-7817","authenticated-orcid":false,"given":"Gabor","family":"Retvari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1644-2172","authenticated-orcid":false,"given":"Peter","family":"Babarczi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erika R.","family":"Berczi-Kovacs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2535771.2535791"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2876749"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486011"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3311\/pp.ee.2010-1-2.04"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900705"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00078-8"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2871307"},{"key":"ref36","year":"2015","journal-title":"Cavium’s XPliant Ethernet Switch Supports the Emerging Open Ecosystems"},{"key":"ref35","article-title":"Intel Ethernet switch FM6000 series-software defined networking","author":"ozdag","year":"2012"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098823"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.bjp.2013.12.035"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767412"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.09.019"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.101004"},{"key":"ref13","author":"huston","year":"0","journal-title":"BGP in 2013"},{"key":"ref14","author":"lonker","year":"2018","journal-title":"Thinking beyond the box–how software defined networks are changing the future of connectivity"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656890"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2491185.2491190"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.17487\/RFC7811"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/MNET.2008.4476066","article-title":"Toward Internet-wide multipath routing","volume":"22","author":"he","year":"2008","journal-title":"IEEE Netw"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140209"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2015.44"},{"key":"ref4","first-page":"17","article-title":"An overview of multipath TCP","volume":"37","author":"bonaventure","year":"2012","journal-title":"login"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/NETSOFT.2018.8459923"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1764873.1764885"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"ref29","article-title":"Independent spanning trees with small stretch factors","author":"annexstein","year":"1996"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535392"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948247"},{"key":"ref7","article-title":"Implementation of multipath network virtualization with SDN and NFV","author":"wang","year":"0","journal-title":"IEEE Access"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1452335.1452342"},{"key":"ref9","author":"bonaventure","year":"2014","journal-title":"NorNet Moving to Multipath TCP"},{"key":"ref1","first-page":"13","article-title":"Improving the reliability of Internet paths with one-hop source routing","author":"gummadi","year":"2004","journal-title":"Proc OSDI"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637237"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2006.996"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.816597"},{"key":"ref47","first-page":"1","article-title":"An architecture for IP\/LDP fast-reroute using maximally redundant trees","author":"atlas","year":"2011","journal-title":"IET PROC"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/90.803380"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/11671411_3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2006.286270"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2810640"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90016-8"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062229"},{"key":"ref43","first-page":"163","article-title":"Polynomial-time computable backup tables for shortest-path routing","author":"ito","year":"2003","journal-title":"Proc SIROCCO"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2161329"}],"container-title":["IEEE Journal on Selected Areas in Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/49\/8692658\/08672589.pdf?arnumber=8672589","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\/8672589\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":47,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/jsac.2019.2906742","relation":{},"ISSN":["0733-8716","1558-0008"],"issn-type":[{"value":"0733-8716","type":"print"},{"value":"1558-0008","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5]]}}}