{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:43:35Z","timestamp":1725543815692},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354741"},{"type":"electronic","value":"9783540354758"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_17","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T14:45:59Z","timestamp":1151073959000},"page":"212-226","source":"Crossref","is-referenced-by-count":3,"title":["Discovering Network Topology in the Presence of Byzantine Faults"],"prefix":"10.1007","author":[{"given":"Mikhail","family":"Nesterenko","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"17_CR1","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1109\/26.24597","volume":"COM-37","author":"J.M. Spinelli","year":"1989","unstructured":"Spinelli, J.M., Gallager, R.G.: Event-driven topology broadcast without sequence numbers. IEEE trans. on commun.\u00a0COM-37(5), 468\u2013474 (1989)","journal-title":"IEEE trans. on commun."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/MM.2002.1134340","volume":"22","author":"J. Hill","year":"2002","unstructured":"Hill, J., Culler, D.: Mica: A wireless platform for deeply embedded networks. IEEE Micro\u00a022, 12\u201324 (2002)","journal-title":"IEEE Micro"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Transactions on Programming Languages and Systems\u00a04, 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Avramopoulos, I.C., Kobayashi, H., Wang, R., Krishnamurthy, A.: Highly secure and efficient routing. In: Proceedings of INFOCOM: The Conference on Computer Communications, joint conference of the IEEE Computer and Communications Societies, Hong Kong (2004)","DOI":"10.1109\/INFCOM.2004.1354494"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/990680.990707","volume":"47","author":"A. Perrig","year":"2004","unstructured":"Perrig, A., Stankovic, J., Wagner, D.: Security in wireless sensor networks. Communications of the ACM\u00a047, 53\u201357 (2004)","journal-title":"Communications of the ACM"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network. In: Proceedings of the Twenty-Fourth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2005), Las Vegas, Nevada (to appear, 2005)","DOI":"10.1145\/1073814.1073841"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D.: The Byzantine generals strike again. Journal of Algorithms\u00a03, 14\u201330 (1982)","journal-title":"Journal of Algorithms"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1145\/1011767.1011807","volume-title":"PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing","author":"C.Y. Koo","year":"2004","unstructured":"Koo, C.Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 275\u2013282. ACM Press, New York (2004)"},{"key":"17_CR9","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. Information Processing Letters\u00a093, 109\u2013115 (2005)","journal-title":"Information Processing Letters"},{"key":"17_CR10","first-page":"6","volume-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"H. Attiya","year":"1998","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics, p. 6. McGraw-Hill Publishing Company, New York (1998)"},{"key":"17_CR11","first-page":"90","volume-title":"The 20th IEEE Symposium on Reliable Distributed Systems (SRDS 2001)","author":"D. Malkhi","year":"2001","unstructured":"Malkhi, D., Reiter, M., Rodeh, O., Sella, Y.: Efficient update diffusion in byzantine environments. In: The 20th IEEE Symposium on Reliable Distributed Systems (SRDS 2001), pp. 90\u201398. IEEE, Washington - Brussels - Tokyo (2001)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(02)00325-0","volume":"299","author":"D. Malkhi","year":"2003","unstructured":"Malkhi, D., Mansour, Y., Reiter, M.K.: Diffusion without false rumors: on propagating updates in a Byzantine environment. Theoretical Computer Science\u00a0299, 289\u2013306 (2003)","journal-title":"Theoretical Computer Science"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-002-0082-4","volume":"16","author":"Y. Minsky","year":"2003","unstructured":"Minsky, Y., Schneider, F.B.: Tolerating malicious gossip. Distributed Computing\u00a016, 49\u201368 (2003)","journal-title":"Distributed Computing"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Masuzawa, T., Tixeuil, S.: A self-stabilizing link-coloring protocol resilient to unbounded byzantine faults in arbitrary networks. Technical Report 1396, Laboratoire de Recherche en Informatique (2005)","DOI":"10.1007\/11795490_11"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Nesterenko, M., Arora, A.: Tolerance to unbounded byzantine faults. In: Proceedings of 21st IEEE Symposium on Reliable Distributed Systems, pp. 22\u201329 (2002)","DOI":"10.1109\/RELDIS.2002.1180170"},{"key":"17_CR16","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)"},{"key":"17_CR17","unstructured":"Masuzawa, T.: A fault-tolerant and self-stabilizing protocol for the topology problem. In: Proceedings of the Second Workshop on Self-Stabilizing Systems, vol.\u00a01, pp. 1.1\u20131.15 (1995)"},{"key":"17_CR18","unstructured":"Yellen, J., Gross, J.L.: Graph Theory & Its Applications. CRC Press, Boca Raton (1998), ISBN: 0\u2013849\u201333982\u20130"},{"key":"17_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-3228-5","volume-title":"Predicate Calculus and Program Semantics","author":"E.W. Dijkstra","year":"1990","unstructured":"Dijkstra, E.W., Scholten, C.S.: Predicate Calculus and Program Semantics. Springer, Berlin (1990)"},{"key":"17_CR20","unstructured":"Nesterenko, M., Tixeuil, S.: Bounds on topology discovery in the presence of byzantine faults. Technical Report TR-KSU-CS-2006-01, Dept. of Computer Science, Kent State University (2006), http:\/\/www.cs.kent.edu\/techreps\/TR-KSU-CS-2006-01.pdf"},{"key":"17_CR21","unstructured":"Nesterenko, M., Tixeuil, S.: Discovering network topology in the presence of byzantine faults. Technical Report TR-KSU-CS-2005-01, Dept. of Computer Science, Kent State University (2005), http:\/\/www.cs.kent.edu\/techreps\/TR-KSU-CS-2005-01.pdf"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"E. Dijkstra","year":"1980","unstructured":"Dijkstra, E., Scholten, C.: Termination detection for diffusing computations. Information Processing Letters\u00a011, 1\u20134 (1980)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780823_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:10Z","timestamp":1619507830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11780823_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}