{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:54:48Z","timestamp":1761976488722,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319030883"},{"type":"electronic","value":"9783319030890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03089-0_8","type":"book-chapter","created":{"date-parts":[[2013,10,17]],"date-time":"2013-10-17T15:18:14Z","timestamp":1382023094000},"page":"98-112","source":"Crossref","is-referenced-by-count":4,"title":["Self-Healing of Byzantine Faults"],"prefix":"10.1007","author":[{"given":"Jeffrey","family":"Knockel","sequence":"first","affiliation":[]},{"given":"George","family":"Saad","sequence":"additional","affiliation":[]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-540-49823-0_39","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"I. Boman","year":"2006","unstructured":"Boman, I., Saia, J., Abdallah, C.T., Schamiloglu, E.: Brief announcement: Self-healing algorithms for reconfigurable networks. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol.\u00a04280, pp. 563\u2013565. Springer, Heidelberg (2006)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Saia, J., Trehan, A.: Picking up the pieces: Self-healing in reconfigurable networks. In: IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, pp. 1\u201312 (2008)","DOI":"10.1109\/IPDPS.2008.4536326"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Hayes, T., Rustagi, N., Saia, J., Trehan, A.: The forgiving tree: a self-healing distributed data structure. In: PODC 2008, pp. 203\u2013212 (2008)","DOI":"10.1145\/1400751.1400779"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Hayes, T.P., Saia, J., Trehan, A.: The forgiving graph: a distributed data structure for low stretch under adversarial attack. In: PODC 2009, pp. 121\u2013130 (2009)","DOI":"10.1145\/1582716.1582740"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Pandurangan, G., Trehan, A.: Xheal: localized self-healing using expanders. In: PODC 2011, pp. 301\u2013310 (2011)","DOI":"10.1145\/1993806.1993865"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Das Sarma, A., Trehan, A.: Edge-preserving self-healing: keeping network backbones densely connected. In: 2012 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 226\u2013231 (2012)","DOI":"10.1109\/INFCOMW.2012.6193496"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2007.v003a001","volume":"3","author":"A. Fiat","year":"2007","unstructured":"Fiat, A., Saia, J.: Censorship resistant peer-to-peer networks. Theory of Computing\u00a03(1), 1\u201323 (2007)","journal-title":"Theory of Computing"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-540-39989-6_23","volume-title":"Distributed Computing","author":"K. Hildrum","year":"2003","unstructured":"Hildrum, K., Kubiatowicz, J.D.: Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 321\u2013336. Springer, Heidelberg (2003)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-45172-3_8","volume-title":"Peer-to-Peer Systems II","author":"M. Naor","year":"2003","unstructured":"Naor, M., Wieder, U.: A simple fault tolerant distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, pp. 88\u201397. Springer, Heidelberg (2003)"},{"key":"8_CR10","unstructured":"Scheideler, C.: How to spread adversarial nodes? rotate! In: STOC 2005 (2005) 704\u2013713"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11561071_71","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Fiat","year":"2005","unstructured":"Fiat, A., Saia, J., Young, M.: Making chord robust to byzantine attacks. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 803\u2013814. Springer, Heidelberg (2005)"},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s00224-008-9099-9","volume":"45","author":"B. Awerbuch","year":"2009","unstructured":"Awerbuch, B., Scheideler, C.: Towards a scalable and robust dht. Theory of Computing Systems\u00a045(2), 234\u2013260 (2009)","journal-title":"Theory of Computing Systems"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-17679-1_18","volume-title":"Distributed Computing and Networking","author":"V. King","year":"2011","unstructured":"King, V., Lonargan, S., Saia, J., Trehan, A.: Load balanced scalable byzantine agreement through quorum building, with full information. In: Aguilera, M.K., Yu, H., Vaidya, N.H., Srinivasan, V., Choudhury, R.R. (eds.) ICDCN 2011. LNCS, vol.\u00a06522, pp. 203\u2013214. Springer, Heidelberg (2011)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Frisanco, T.: Optimal spare capacity design for various protection switching methods in atm networks. In: ICC 1997 Montreal, vol.\u00a01, pp. 293\u2013298 (1997)","DOI":"10.1109\/ICC.1997.605267"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/90.700896","volume":"6","author":"R. Iraschko","year":"1998","unstructured":"Iraschko, R., MacGregor, M., Grover, W.: Optimal capacity placement for path restoration in stm or atm mesh-survivable networks. IEEE\/ACM Transactions on Networking\u00a06(3), 325\u2013336 (1998)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Murakami, K., Kim, H.: Comparative study on restoration schemes of survivable atm networks. In: INFOCOM 1997, vol.\u00a01, pp. 345\u2013352 (1997)","DOI":"10.1109\/INFCOM.1997.635156"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Van Caenegem, B., Wauters, N., Demeester, P.: Spare capacity assignment for different restoration strategies in mesh survivable networks. In: Communications, ICC 1997 Montreal, vol.\u00a01, pp. 288\u2013292 (1997)","DOI":"10.1109\/ICC.1997.605255"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/90.759330","volume":"7","author":"Y. Xiong","year":"1999","unstructured":"Xiong, Y., Mason, L.: Restoration strategies and spare capacity requirements in self-healing atm networks. IEEE\/ACM Transactions on Networking\u00a07(1), 98\u2013110 (1999)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"4","key":"8_CR19","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.ipl.2007.11.004","volume":"106","author":"J. Saia","year":"2008","unstructured":"Saia, J., Young, M.: Reducing communication costs in robust peer-to-peer networks. Information Processing Letters\u00a0106(4), 152\u2013158 (2008)","journal-title":"Information Processing Letters"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Young, M., Kate, A., Goldberg, I., Karsten, M.: Practical robust communication in dhts tolerating a byzantine adversary. In: ICDCS 2010, pp. 263\u2013272 (2010)","DOI":"10.1109\/ICDCS.2010.31"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-45749-6_30","volume-title":"Algorithms - ESA 2002","author":"M. Datar","year":"2002","unstructured":"Datar, M.: Butterflies and peer-to-peer networks. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 310\u2013322. Springer, Heidelberg (2002)"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/TNET.2012.2195729","volume":"21","author":"M. Young","year":"2013","unstructured":"Young, M., Kate, A., Goldberg, I., Karsten, M.: Towards practical communication in byzantine-resistant dhts. IEEE\/ACM Transactions on Networking\u00a021(1), 190\u2013203 (2013)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Kate, A., Goldberg, I.: Distributed key generation for the internet. In: ICDCS 2009, pp. 119\u2013128 (2009)","DOI":"10.1109\/ICDCS.2009.21"},{"key":"8_CR24","unstructured":"Fiat, A., Saia, J.: Censorship resistant peer-to-peer content addressable networks. In: SODA 2002, pp. 94\u2013103 (2002)"}],"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-03089-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T17:25:55Z","timestamp":1746033955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03089-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319030883","9783319030890"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03089-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}