{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:11:11Z","timestamp":1725563471988},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157622"},{"type":"electronic","value":"9783642157639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_47","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T09:48:44Z","timestamp":1282643324000},"page":"495-509","source":"Crossref","is-referenced-by-count":11,"title":["The Impact of Topology on Byzantine Containment in Stabilization"],"prefix":"10.1007","author":[{"given":"Swan","family":"Dubois","sequence":"first","affiliation":[]},{"given":"Toshimitsu","family":"Masuzawa","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"11","key":"47_CR1","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. ACM Commun.\u00a017(11), 643\u2013644 (1974)","journal-title":"ACM Commun."},{"key":"47_CR2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-stabilization","author":"S. Dolev","year":"2000","unstructured":"Dolev, S.: Self-stabilization. MIT Press, Cambridge (March 2000)"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Tixeuil, S.: Self-stabilizing Algorithms. Chapman & Hall\/CRC Applied Algorithms and Data Structures. In: Algorithms and Theory of Computation Handbook, 2nd edn., pp. 26.1\u201326.45. CRC Press, Taylor & Francis Group (November 2009)","DOI":"10.1201\/9781584888215-c26"},{"issue":"3","key":"47_CR4","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst.\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Nesterenko, M., Tixeuil, S.: Discovering network topology in the presence of byzantine nodes. IEEE Trans. Parallel Distrib. Syst. (October 2009)","DOI":"10.1109\/TPDS.2009.25"},{"issue":"5","key":"47_CR6","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1145\/1017460.1017463","volume":"51","author":"S. Dolev","year":"2004","unstructured":"Dolev, S., Welch, J.L.: Self-stabilizing clock synchronization in the presence of byzantine faults. J. ACM\u00a051(5), 780\u2013799 (2004)","journal-title":"J. ACM"},{"key":"47_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/11577327_4","volume-title":"Self-Stabilizing Systems","author":"A. Daliot","year":"2005","unstructured":"Daliot, A., Dolev, D.: Self-stabilization of byzantine protocols. In: Tixeuil, S., Herman, T. (eds.) SSS 2005. LNCS, vol.\u00a03764, pp. 48\u201367. Springer, Heidelberg (2005)"},{"key":"47_CR8","first-page":"22","volume-title":"21st Symposium on Reliable Distributed Systems","author":"M. Nesterenko","year":"2002","unstructured":"Nesterenko, M., Arora, A.: Tolerance to unbounded byzantine faults. In: 21st Symposium on Reliable Distributed Systems, p. 22. IEEE Computer Society, Los Alamitos (2002)"},{"key":"47_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/1400751.1400802","volume-title":"PODC","author":"M. Ben-Or","year":"2008","unstructured":"Ben-Or, M., Dolev, D., Hoch, E.N.: Fast self-stabilizing byzantine tolerant digital clock synchronization. In: Bazzi, R.A., Patt-Shamir, B. (eds.) PODC, pp. 385\u2013394. ACM, New York (2008)"},{"key":"47_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-75142-7_17","volume-title":"Distributed Computing","author":"D. Dolev","year":"2007","unstructured":"Dolev, D., Hoch, E.N.: On self-stabilizing synchronous actions despite byzantine attacks. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 193\u2013207. Springer, Heidelberg (2007)"},{"key":"47_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-540-49823-0_25","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"E.N. Hoch","year":"2006","unstructured":"Hoch, E.N., Dolev, D., Daliot, A.: Self-stabilizing byzantine digital clock synchronization. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol.\u00a04280, pp. 350\u2013362. Springer, Heidelberg (2006)"},{"key":"47_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/11516798_21","volume-title":"Principles of Distributed Systems","author":"Y. Sakurai","year":"2005","unstructured":"Sakurai, Y., Ooshita, F., Masuzawa, T.: A self-stabilizing link-coloring protocol resilient to byzantine faults in tree networks. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol.\u00a03544, pp. 283\u2013298. Springer, Heidelberg (2005)"},{"issue":"1","key":"47_CR13","first-page":"1","volume":"1","author":"T. Masuzawa","year":"2007","unstructured":"Masuzawa, T., Tixeuil, S.: Stabilizing link-coloration of arbitrary networks with unbounded byzantine faults. International Journal of Principles and Applications of Information Science and Technology (PAIST)\u00a01(1), 1\u201313 (2007)","journal-title":"International Journal of Principles and Applications of Information Science and Technology (PAIST)"},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"Dubois, S., Potop-Butucaru, M.G., Nesterenko, M., Tixeuil, S.: Self-stabilizing byzantine asynchronous unison. CoRR\u00a0abs\/0912.0134 (2009)","DOI":"10.1007\/978-3-642-17653-1_7"},{"key":"47_CR15","first-page":"10","volume-title":"WSS","author":"M.G. Gouda","year":"1999","unstructured":"Gouda, M.G., Schneider, M.: Stabilization of maximal metric trees. In: Arora, A. (ed.) WSS, pp. 10\u201317. IEEE Computer Society, Los Alamitos (1999)"},{"issue":"4","key":"47_CR16","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1109\/TNET.2003.815294","volume":"11","author":"M.G. Gouda","year":"2003","unstructured":"Gouda, M.G., Schneider, M.: Maximizable routing metrics. IEEE\/ACM Trans. Netw.\u00a011(4), 663\u2013675 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"47_CR17","doi-asserted-by":"crossref","unstructured":"Dubois, S., Masuzawa, T., Tixeuil, S.: The Impact of Topology on Byzantine Containment in Stabilization. Research report inria-00481836 (May 2010), http:\/\/hal.inria.fr\/inria-00481836\/en\/","DOI":"10.1007\/978-3-642-15763-9_47"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:51Z","timestamp":1606185591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}