{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:21:12Z","timestamp":1740133272272,"version":"3.37.3"},"reference-count":61,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Federal Ministry of Education and Research (BMBF)","award":["16KISK020K"],"award-info":[{"award-number":["16KISK020K"]}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"European Union\u2019s Horizon 2020 Research and Innovation Programme","doi-asserted-by":"publisher","award":["716562"],"award-info":[{"award-number":["716562"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund (WWTF)","doi-asserted-by":"publisher","award":["ICT19-045"],"award-info":[{"award-number":["ICT19-045"]}],"id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["867\/19"],"award-info":[{"award-number":["867\/19"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1109\/tnet.2023.3283184","type":"journal-article","created":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T18:29:24Z","timestamp":1687199364000},"page":"283-297","source":"Crossref","is-referenced-by-count":1,"title":["Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3290-0674","authenticated-orcid":false,"given":"Christoph","family":"Lenzen","sequence":"first","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbrücken, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5572-3754","authenticated-orcid":false,"given":"Moti","family":"Medina","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, Bar-Ilan University, Ramat Gan, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-2095-4219","authenticated-orcid":false,"given":"Mehrdad","family":"Saberi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Maryland, College Park, MD, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"Department of EECS, TU Berlin, Berlin, Germany"}]}],"member":"263","reference":[{"key":"ref1","first-page":"771","article-title":"Dynamic routing on networks with fixed-size buffers","volume-title":"Proc. SODA","author":"Aiello"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/1402946.1402967"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/100216.100254"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/502034.502048"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1007\/s00453-007-9143-1"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.17487\/rfc5286"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/MM.2003.1196112"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1145\/777412.777446"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1016\/j.tcs.2016.11.022"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/j.ic.2011.10.007"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.36227\/techrxiv.12367508.v2"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TNET.2016.2619398"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/3359989.3365410"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1007\/BF01196259"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1007\/978-3-540-87779-0_12"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1145\/2755573.2755588"},{"volume-title":"Proc. ESA","author":"Even","article-title":"A constant approximation algorithm for scheduling packets on line networks","key":"ref17"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1145\/2332432.2332478"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/DSN-W.2016.38"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1145\/3149.214121"},{"volume-title":"Proc. Int. Symp. Distrib. Comput. (DISC)","author":"Foerster","article-title":"Brief announcement: What can(not) be perfectly rerouted locally","key":"ref21"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/SRDS47363.2019.00028"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1145\/1070873.1070877"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/TCOM.1981.1094876"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1145\/945445.945450"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1145\/2043164.2018477"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/WAINA.2011.55"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1145\/1096536.1096541"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1145\/1592568.1592577"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/43.159993"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1145\/637201.637238"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1145\/3281411.3281432"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1137\/S0036144501387141"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1137\/s1064827595287997"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1109\/JSAC.2011.111002"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1109\/ISADS.2003.1193942"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1007\/s00446-010-0099-z"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1145\/1282427.1282408"},{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1109\/TNET.2010.2050490"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1016\/c2013-0-08299-0"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1007\/978-3-319-69084-1_13"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1145\/2629508"},{"key":"ref43","first-page":"113","article-title":"Ensuring connectivity via data plane mechanisms","volume-title":"Proc. USENIX NSDI","author":"Liu"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1109\/INFCOM.2004.1354653"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1109\/TNET.2007.902727"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1109\/ICNP.2015.47"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.17487\/rfc1142"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.17487\/rfc4090"},{"key":"ref49","article-title":"Fault-tolerant logical network structures","volume":"118","author":"Parter","year":"2016","journal-title":"Bull. EATCS"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1145\/322186.322188"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1016\/j.ipl.2004.10.007"},{"doi-asserted-by":"publisher","key":"ref52","DOI":"10.1145\/3292040.3219648"},{"year":"2016","author":"Previdi","journal-title":"Source Packet Routing in Networking (SPRING) Problem Statement and Requirements, document RFC 7855, Request for Comments","key":"ref53"},{"doi-asserted-by":"publisher","key":"ref54","DOI":"10.1007\/978-3-642-03073-4_43"},{"doi-asserted-by":"publisher","key":"ref55","DOI":"10.1007\/s00224-011-9351-6"},{"volume-title":"Proc. Eur. Symp. Algorithms (ESA)","author":"Raecke","article-title":"Compact oblivious routing","key":"ref56"},{"doi-asserted-by":"publisher","key":"ref57","DOI":"10.1145\/1060590.1060694"},{"doi-asserted-by":"publisher","key":"ref58","DOI":"10.1145\/964725.633039"},{"doi-asserted-by":"publisher","key":"ref59","DOI":"10.1145\/2890955.2890957"},{"doi-asserted-by":"publisher","key":"ref60","DOI":"10.1145\/2838344.2856460"},{"doi-asserted-by":"publisher","key":"ref61","DOI":"10.1109\/INFOCOM.2014.6848098"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/10439254\/10155456.pdf?arnumber=10155456","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T10:54:15Z","timestamp":1709290455000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10155456\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":61,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2023.3283184","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2024,2]]}}}