{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T06:05:48Z","timestamp":1738217148736,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770954"},{"type":"electronic","value":"9783540770961"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77096-1_6","type":"book-chapter","created":{"date-parts":[[2008,4,11]],"date-time":"2008-04-11T11:44:46Z","timestamp":1207914286000},"page":"76-89","source":"Crossref","is-referenced-by-count":4,"title":["Byzantine Consensus with Few Synchronous Links"],"prefix":"10.1007","author":[{"given":"Moumen","family":"Hamouma","sequence":"first","affiliation":[]},{"given":"Achour","family":"Mostefaoui","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Tr\u00e9dan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/BFb0030680","volume-title":"Distributed Algorithms","author":"M.K. Aguilera","year":"1997","unstructured":"Aguilera, M.K., Chen, W., Toueg, S.: Heartbeat: a timeout-free failure detector for quiescent reliable communication. In: Mavronicolas, M. (ed.) WDAG 1997. LNCS, vol.\u00a01320, pp. 126\u2013140. Springer, Heidelberg (1997)"},{"key":"6_CR2","volume-title":"PODC 2004","author":"M.K. Aguilera","year":"2004","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Communication-efficient leader election and consensus with limited link synchrony. In: PODC 2004. Proc. 23nd ACM Symposium on Principles of Distributed Computing, ACM Press, New York (2004)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Consensus with byzantine failures and little system synchrony. In: DSN 2006. Proc. International Conference on Dependable Systems and Networks, Philadelphia (2006)","DOI":"10.1109\/DSN.2006.22"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Basu, A., Charron-Bost, B., Toueg, T.: Crash failures vs. crash + link failures. In: PODC 1996. Proc 15th ACM Symposium on Principles of Distributed Computing, Philadelphia, Pennsylvania (1996)","DOI":"10.1145\/248052.248102"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/800221.806707","volume-title":"PODC 1983","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M.: Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. In: PODC 1983. Proc. 2nd ACM Symposium on Principles of Distributed Computing, pp. 27\u201330. ACM Press, New York (1983)"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/637437.637447","volume":"34","author":"B. Boichat","year":"2003","unstructured":"Boichat, B., Dutta, P., Fr\u00f6lund, S., Guerraoui, G.: Deconstructing paxos. SIGACT News in Distributed Computing\u00a034(1), 47\u201367 (2003)","journal-title":"SIGACT News in Distributed Computing"},{"key":"6_CR7","unstructured":"Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Proc. of the 3rd Symposium on Operating Systems Design and Implementation, New Orleans, USA (February 1999)"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"key":"6_CR9","first-page":"13","volume":"17","author":"M. Correia","year":"2004","unstructured":"Correia, M., Neves, N.F., Lung, L.C., Verissimo, P.: Low Complexity Byzantine-Resilient Consensus. Distributed Computing\u00a017, 13 (2004)","journal-title":"Distributed Computing"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Doudou, A., Garbinato, B., Guerraoui, R.: Encapsulating Failure Detection: from Crash to Byzantine Failures. In: Proc. International Conference on Reliable Software Technologies, Vienna (Austria) (2002)","DOI":"10.1007\/3-540-48046-3_3"},{"key":"6_CR11","unstructured":"Dutta, P., Guerraoui, R., Vukolic, M.: Best-case complexity of asynchronous byzantine consensus. Technical Report EPFL\/IC\/200499, EPFL (February 2005)"},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N.A., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of the ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"Journal of the ACM"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N., Paterson, M.S.: Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/TDSC.2005.13","volume":"2","author":"R. Friedman","year":"2005","unstructured":"Friedman, R., Mostefaoui, A., Raynal, M.: Simple and efficient oracle-based consensus protocols for asynchronous byzantine systems. IEEE Transactions on Dependable and Secure Computing\u00a02(1), 46\u201356 (2005)","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Hutle, M., Malkhi, D., Schmid, U., Zhou, L.: Chasing the Weakest System Model for Implementing Omega and Consensus. Research Report 74\/2005, Technische Universit\u00e4t Wien, Institut f\u00fcr Technische Informatik (July 2006)","DOI":"10.1007\/978-3-540-49823-0_45"},{"key":"6_CR16","unstructured":"Kihlstrom, K.P., Moser, L.E., Melliar-Smith, P.M.: Solving Consensus in a Byzantine Environment Using an Unreliable Fault Detector. In: OPODIS 1997. Proc. of the Int. Conference on Principles of Distributed Systems, pp. 61\u201375 (1997)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Kursawe, K.: Optimistic Byzantine agreement. In: SRDS 2002 Workshops. Proc. of the 21st IEEE Symposium on Reliable Distributed Systems (2002)","DOI":"10.1109\/RELDIS.2002.1180196"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s00446-006-0155-x","volume":"19","author":"L. Lamport","year":"2006","unstructured":"Lamport, L.: Lower bounds for asynchronous consensus. Distributed Computing\u00a019(2), 104\u2013125 (2006)","journal-title":"Distributed Computing"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","first-page":"26","volume-title":"Distributed Computing","author":"D. Malkhi","year":"2005","unstructured":"Malkhi, D., Oprea, F., Zhou, L.: \u03a9 meets paxos: Leader election and stability without eventual timely links. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 26\u201329. Springer, Heidelberg (2005)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Martin, J.P., Alvisi, L.: Fast Byzantine paxos. In: DSN 2005. Proc. International Conference on Dependable Systems and Networks, Yokohama, Japan, pp. 402\u2013411 (2005)","DOI":"10.1109\/DSN.2005.48"},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"L. Pease","year":"1980","unstructured":"Pease, L., Shostak, R., Lamport, L.: Reaching Agreement in Presence of Faults. Journal of the ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM"},{"key":"6_CR22","first-page":"403","volume-title":"FOCS 1983","author":"M. Rabin","year":"1983","unstructured":"Rabin, M.: Randomized Byzantine Generals. In: FOCS 1983. Proc. 24th IEEE Symposium on Foundations of Computer Science, pp. 403\u2013409. IEEE Computer Society Press, Los Alamitos (1983)"},{"issue":"4","key":"6_CR23","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"F.B. Schneider","year":"1990","unstructured":"Schneider, F.B.: Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial. ACM Computing Surveys\u00a022(4), 299\u2013319 (1990)","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"6_CR24","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/BF01667080","volume":"2","author":"T.K. Srikanth","year":"1987","unstructured":"Srikanth, T.K., Toueg, S.: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distributed Computing\u00a02(2), 380\u2013394 (1987)","journal-title":"Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77096-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T16:41:26Z","timestamp":1738168886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77096-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540770954","9783540770961"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77096-1_6","relation":{},"subject":[]}}