{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:29:47Z","timestamp":1772908187724,"version":"3.50.1"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T00:00:00Z","timestamp":1655078400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T00:00:00Z","timestamp":1655078400000},"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":[],"published-print":{"date-parts":[[2022,6,13]]},"DOI":"10.23919\/ifipnetworking55013.2022.9829760","type":"proceedings-article","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T16:42:14Z","timestamp":1658508134000},"page":"1-9","source":"Crossref","is-referenced-by-count":4,"title":["Routing on the Shortest Pairs of Disjoint Paths"],"prefix":"10.23919","author":[{"given":"Peter","family":"Babarczi","sequence":"first","affiliation":[{"name":"Budapest University of Technology and Economics,Faculty of Electrical Engineering and Informatics,Department of Telecommunications and Media Informatics,Budapest,Hungary,H-1111"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabor","family":"Retvari","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics,Faculty of Electrical Engineering and Informatics,Department of Telecommunications and Media Informatics,Budapest,Hungary,H-1111"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lajos","family":"Ronyai","sequence":"additional","affiliation":[{"name":"Institute for Computer Science and Control, Institute of Mathematics, Budapest University of Technology and Economics, Eötvös Lorand Research Network,Department of Algebra,Budapest,Hungary,H-1111"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janos","family":"Tapolcai","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics,Faculty of Electrical Engineering and Informatics,Department of Telecommunications and Media Informatics,Budapest,Hungary,H-1111"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402963"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.101004"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.17487\/rfc4984"},{"key":"ref13","article-title":"Segment Routing with MPLS data plane","author":"filsfils","year":"2015","journal-title":"Active Internet-Draft"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061933"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140209"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.212275"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2906742"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/90.803380"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","article-title":"Finding the k shortest loopless paths in a network","volume":"17","author":"yen","year":"1971","journal-title":"Management Science"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2123916"},{"key":"ref27","first-page":"1","article-title":"The critical role of maximum SID depth (MSD) hardware limitatons in segment routing ecosystem and how to work around those","author":"tantsura","year":"2017","journal-title":"NANOG"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3063980"},{"key":"ref6","first-page":"204","article-title":"Robustly dis-joint paths with segment routing","author":"aubry","year":"2018","journal-title":"ACM CoNeXT"},{"key":"ref5","first-page":"13","article-title":"Improving the reliability of internet paths with one-hop source routing","author":"gummadi","year":"2004","journal-title":"USENIX OSDI"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1764873.1764885"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2731419"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2453941"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159933"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2015.02.010"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90024-7"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803884"},{"key":"ref26","year":"0","journal-title":"Lemon A c++ Library for Efficient Modeling and Optimization in Networks"},{"key":"ref25","article-title":"SNDlib 1.0-Survivable Network Design Library","author":"orlowski","year":"2007","journal-title":"Proc INOC"}],"event":{"name":"2022 IFIP Networking Conference (IFIP Networking)","location":"Catania, Italy","start":{"date-parts":[[2022,6,13]]},"end":{"date-parts":[[2022,6,16]]}},"container-title":["2022 IFIP Networking Conference (IFIP Networking)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9829715\/9829755\/09829760.pdf?arnumber=9829760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T20:23:49Z","timestamp":1662409429000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9829760\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,13]]},"references-count":27,"URL":"https:\/\/doi.org\/10.23919\/ifipnetworking55013.2022.9829760","relation":{},"subject":[],"published":{"date-parts":[[2022,6,13]]}}}