{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:38:13Z","timestamp":1742398693022},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617693"},{"type":"electronic","value":"9783540706793"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61769-8_8","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:22:03Z","timestamp":1330294923000},"page":"105-122","source":"Crossref","is-referenced-by-count":38,"title":["Simulating reliable links with unreliable links in the presence of process crashes"],"prefix":"10.1007","author":[{"given":"Anindya","family":"Basu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernadette","family":"Charron-Bost","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"6","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1145\/195613.195651","volume":"41","author":"Y. Afek","year":"1994","unstructured":"Y. Afek, H. Attiya, A. D. Fekete, M. Fischer, N. Lynch, Y. Mansour, D. Wang, and L. Zuck. Reliable communication over unreliable channels. Journal of the ACM, 41(6):1267\u20131297, 1994.","journal-title":"Journal of the ACM"},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H. Attiya","year":"1990","unstructured":"H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, and R. Reischuk. Renaming in an asynchronous environment. Journal of the ACM, 37(3):524\u2013548, 1990.","journal-title":"Journal of the ACM"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and S. Even. Reliable broadcast protocols in unreliable networks. Networks: An International Journal, 16, 1986.","DOI":"10.1002\/net.3230160405"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, O. Goldreich, and A. Herzberg. A quantitative approach to dynamic networks. In Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, pages 189\u2013204, Qu\u00e9bec City, Qu\u00e9bec, Canada, 1990.","DOI":"10.1145\/93385.93419"},{"key":"8_CR5","volume-title":"Technical report","author":"A. Basu","year":"1996","unstructured":"A. Basu, B. Charron-Bost, and S. Toueg. Simulating reliable links with unreliable links in the presence of process crashes. Technical report, Cornell University, Dept. of Computer Science, Cornell University, Ithaca, NY 14853, 1996."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"K. Birman. Replication and fault-tolerance in the ISIS system. In Proceedings of the 10th ACM Symposium on Operating Systems Principles, pages 79\u201386, Orcas Island, WA USA, 1985.","DOI":"10.1145\/323647.323636"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"R. Bazzi and G. Neiger. Simulating crash failures with many faulty processors. In A. Segal and S. Zaks, editors, Proceedings of the Sixth International Workshop on Distributed Algorithms, volume 647 of Lecture Notes on Computer Science, pages 166\u2013184. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-56188-9_12"},{"issue":"5","key":"8_CR8","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/362946.362970","volume":"12","author":"K. A. Bartlett","year":"1969","unstructured":"K. A. Bartlett, R. A. Scantlebury, and P. T. Wilkinson. A note on reliable full-duplex transmission over half-duplex links. Comm. of the ACM, 12(5):260\u2013261, 1969.","journal-title":"Comm. of the ACM"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri. Agreement is harder than consensus: Set consensus problems in totally asynchronous systems. In Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, pages 311\u2013324, Qu\u00e9bec City, Qu\u00e9bec, Canada, August 1990.","DOI":"10.1145\/93385.93431"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D. Dolev","year":"1986","unstructured":"D. Dolev, N. A. Lynch, S. S. Pinter, E. W. Stark, and W. E. Weihl. Reaching approximate agreement in the presence of faults. Journal of the ACM, 33(3):499\u2013516, July 1986.","journal-title":"Journal of the ACM"},{"issue":"5","key":"8_CR11","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1145\/174147.169676","volume":"40","author":"A. D. Fekete","year":"1993","unstructured":"A. D. Fekete, N. Lynch, Y. Mansour, and J. Spinelli. The impossibility of implementing reliable communication in the face of crashes. Journal of the ACM, 40(5):1087\u20131107, 1993.","journal-title":"Journal of the ACM"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"E. Gafni and Y. Afek. End-to-end communication in unreliable networks. In Proceedings of the Seventh ACM Symposium on Principles of Distributed Computing, pages 131\u2013148, Toronto, Ontario, Canada, August 1988.","DOI":"10.1145\/62546.62570"},{"key":"8_CR13","unstructured":"A. Gopal. Fault-Tolerant Broadcasts and Multicasts: The Problem of Inconsistency and Contamination. PhD thesis, Cornell University, January 1992."},{"key":"8_CR14","volume-title":"Technical Report TR 94-1425","author":"V. Hadzilacos","year":"1994","unstructured":"V. Hadzilacos and S. Toueg. A modular approach to fault-tolerant broadcasts and related problems. Technical Report TR 94-1425, Cornell University, Dept. of Computer Science, Cornell University, Ithaca, NY 14853, May 1994."},{"issue":"7","key":"8_CR15","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558\u2013565, July 1978.","journal-title":"Communications of the ACM"},{"key":"8_CR16","first-page":"657","volume-title":"Information Processing 83: proceedings of the IFIP Ninth World Congress","author":"L. Lamport","year":"1983","unstructured":"L. Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: proceedings of the IFIP Ninth World Congress, pages 657\u2013668. IFIP, North-Holland, September 1983."},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0196-6774(90)90019-B","volume":"11","author":"G. Neiger","year":"1990","unstructured":"G. Neiger and S. Toueg. Automatically increasing the fault-tolerance of distributed algorithms. Journal of Algorithms, 11(3):374\u2013419, 1990.","journal-title":"Journal of Algorithms"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"D. Wang and L. Zuck. Tight bounds for the sequence transmission problem. In Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, pages 73\u201383, August 1989.","DOI":"10.1145\/72981.72986"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61769-8_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:10:31Z","timestamp":1605647431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61769-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617693","9783540706793"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-61769-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}