{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T01:40:11Z","timestamp":1750902011123,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319690834"},{"type":"electronic","value":"9783319690841"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69084-1_13","type":"book-chapter","created":{"date-parts":[[2017,10,6]],"date-time":"2017-10-06T03:30:06Z","timestamp":1507260606000},"page":"187-202","source":"Crossref","is-referenced-by-count":1,"title":["Robust Routing Made Easy"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Lenzen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Medina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,7]]},"reference":[{"key":"13_CR1","unstructured":"Aiello, W., Kushilevitz, E., Ostrovsky, R., Ros\u00e9n, A.: Dynamic routing on networks with fixed-size buffers. In: SODA, pp. 771\u2013780 (2003)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Seymour, P., Thomas, R.: A separator theorem for graphs with an excluded minor and its applications. In: STOC, pp. 293\u2013299. ACM (1990)","DOI":"10.1145\/100216.100254"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00453-007-9143-1","volume":"55","author":"S Angelov","year":"2009","unstructured":"Angelov, S., Khanna, S., Kunal, K.: The network as a storage device: dynamic routing with bounded buffers. Algorithmica 55(1), 71\u201394 (2009)","journal-title":"Algorithmica"},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1109\/TCAD.2011.2179038","volume":"31","author":"H Cho","year":"2012","unstructured":"Cho, H., Leem, L., Mitra, S.: ERSA: error resilient system architecture for probabilistic applications. Trans. Comput.-Aided Des. Integr. Circ. Syst. 31(4), 546\u2013558 (2012)","journal-title":"Trans. Comput.-Aided Des. Integr. Circ. Syst."},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-540-87779-0_12","volume-title":"Distributed Computing","author":"D Dolev","year":"2008","unstructured":"Dolev, D., Hoch, E.N.: Constant-space localized byzantine consensus. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 167\u2013181. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-87779-0_12"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Even, G., Medina, M., Patt-Shamir, B.: Better deterministic online packet routing on grids. In: SPAA, pp. 284\u2013293 (2015)","DOI":"10.1145\/2755573.2755588"},{"key":"13_CR7","unstructured":"Even, G., Medina, M., Ros\u00e9n, A.: A constant approximation algorithm for scheduling packets on line networks. In: ESA, pp. 40:1\u201340:16 (2016)"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M Fischer","year":"1985","unstructured":"Fischer, M., Lynch, N., Paterson, N.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Kang, Y.H., Kwon, T., Draper, J.: Fault-tolerant flow control in on-chip networks. In: NOCS, pp. 79\u201386 (2010)","DOI":"10.1109\/NOCS.2010.18"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Kopetz, H.: Fault containment and error detection in the time-triggered architecture. In: ISADS, pp. 139\u2013146 (2003)","DOI":"10.1109\/ISADS.2003.1193942"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/2629508","volume":"11","author":"R Levi","year":"2015","unstructured":"Levi, R., Ron, D.: A quasi-polynomial time partition oracle for graphs with an excluded minor. ACM Trans. Algorithms 11(3), 24:1\u201324:13 (2015)","journal-title":"ACM Trans. Algorithms"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Park, D., Nicopoulos, C., Kim, J., Vijaykrishnan, N., Das, C.R.: Exploring fault-tolerant network-on-chip architectures. In: DSN, pp. 93\u2013104 (2006)","DOI":"10.1109\/DSN.2006.35"},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ipl.2004.10.007","volume":"93","author":"A Pelc","year":"2005","unstructured":"Pelc, A., Peleg, D.: Broadcasting with locally bounded byzantine faults. Inf. Process. Lett. 93(3), 109\u2013115 (2005)","journal-title":"Inf. Process. Lett."},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-03073-4_43","volume-title":"Mathematical Theory and Computational Practice","author":"H R\u00e4cke","year":"2009","unstructured":"R\u00e4cke, H.: Survey on oblivious routing strategies. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 419\u2013429. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03073-4_43"},{"issue":"4","key":"13_CR15","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1007\/s00224-011-9351-6","volume":"49","author":"H R\u00e4cke","year":"2011","unstructured":"R\u00e4cke, H., Ros\u00e9n, A.: Approximation algorithms for time-constrained scheduling on line networks. Theory Comput. Syst. 49(4), 834\u2013856 (2011)","journal-title":"Theory Comput. Syst."},{"key":"13_CR16","unstructured":"Rotem-Gal-Oz, A.: Fallacies of Distributed Computing Explained. http:\/\/www.rgoarchitects.com\/Files\/fallacies.pdf"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69084-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T01:03:31Z","timestamp":1750899811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69084-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319690834","9783319690841"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69084-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}