Article

Tolerating corrupted communication

Authors:

Bernadette Charron-Bost,

Antoine Gaillard,

André SchiperAuthors Info & Claims

PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing

Pages 244 - 253

https://doi.org/10.1145/1281100.1281136

Published: 12 August 2007 Publication History

Abstract

Consensus encalpsulates the inherent problems of building fault tolerant distributed systems. In this context, the classic model of Byzantine faulty processes can be restated such that messages from a subset of processes can be arbitrarily corrupted (including addition and omission of messages).

We consider the case of dynamic and transient faults,that may affect all processes and that are not permanent, and we model them via corrupted communication. For corrupted communication it is natural to distinguish between the safety of communication, which is concerned with the number of altered messages, and the liveness of communication, which restricts message loss.

We present two consensus algorithms, together with sufficient conditions on the system to ensure correctness. Our first algorithm needs strong conditions on safety but requires weak conditions on liveness in order to terminate. Our second algorithm tolerates a lower degree of communication safety at the price of stronger liveness conditions.

Our algorithms allow us to circumvent the resilience lower bounds from Santoro/Widmayer and Martin/Alvisi.

References

[1]

I. Abraham, G. Chockler, I. Keidar, and D. Malkhi. Byzantine disk paxos: optimal resilience with Byzantine shared memory. Distributed Computing, 18(5):387--408, 2006.

Digital Library

[2]

M. K. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. Consensus with Byzantine failures and little system synchrony. In Dependable Systems and Networks (DSN 2006), pages 147--155, 2006.

Digital Library

[3]

H. Attiya and J. Welch. Distributed Computing. John Wiley & Sons, 2nd edition, 2004.

[4]

M. Castro and B. Liskov. Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems, 20(4):398--461, 2002.

Digital Library

[5]

B. Charron-Bost and A. Schiper. Improving fast paxos: being optimistic with no overhead. In Pacific Rim Dependable Computing, Proceedings, pages 287--295, 2006.

Digital Library

[6]

B. Charron-Bost and A. Schiper. The Heard-Of model: Computing in distributed systens with benign failures. Technical report, EPFL, 2007.

[7]

C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288--323, Apr. 1988.

Digital Library

[8]

E. Gafni. Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony. In Proc. 16th Annual ACM Symposium on Principles of Distributed Computing (PODC'98), pages 143--152, Puerto Vallarta, Mexico, 1998. ACM Press.

Digital Library

[9]

J. N. Gray. Notes on data base operating systems. In G. S. R. Bayer, R. M. Graham, editor, Operating Systems: An Advanced Course, volume 60 of Lecture Notes in Computer Science, chapter 3.F, page 465. Springer, New York, 1978.

Digital Library

[10]

M. Hutle and A. Schiper. Communication predicates: A high-level abstraction for coping with transient and dynamic faults. In Dependable Systems and Networks (DSN 2007), 2007.

Digital Library

[11]

L. Lamport. Lower bounds for asynchronous consensus. In Future Directions in Distributed Computing, number 2584 in Lecture Notes in Computer Science, pages 22--23. Springer-Verlag, 2003.

Digital Library

[12]

L. Lamport. Fast paxos. Technical Report MSR-TR-2005-12, Microsoft Research, 2005.

[13]

L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Trans. Program. Lang. Syst., 4(3):382--401, 1982.

Digital Library

[14]

B. Lampson. The ABCD's of paxos. In Proc. 19th Annual ACM Symposium on Principles of Distributed Computing (PODC'01), page 13, New York, NY, USA, 2001. ACM Press.

Digital Library

[15]

N. Lynch. Distributed Algorithms. Morgan Kaufman, 1996.

Digital Library

[16]

J.-P. Martin and L. Alvisi. Fast Byzantine consensus. Transactions on Dependable and Secure Computing, 3(3):202--214, 2006.

Digital Library

[17]

M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228--234, 1980.

Digital Library

[18]

N. Santoro and P. Widmayer. Time is not a healer. In Proc. 6th Annual Symposium on Theor. Aspects of Computer Science (STACS'89), volume 349 of LNCS, pages 304--313, Paderborn, Germany, Feb. 1989. Springer-Verlag.

Digital Library

[19]

N. Santoro and P. Widmayer. Distributed function evaluation in the presence of transmission faults. In SIGAL International Symposium on Algorithms, pages 358--367, 1990.

Digital Library

[20]

U. Schmid, B. Weiss, and J. Rushby. Formally verified Byzantine agreement in presence of link faults. In 22nd International Conference on Distributed Computing Systems (ICDCS'02), pages 608--616, Vienna, Austria, July 2-5, 2002.

Digital Library

[21]

G. Varghese and N. A. Lynch. A tradeoff between safety and liveness for randomized coordinated attack. Inf. Comput., 128(1):57--71, 1996.

Digital Library

[22]

P. Zieliński. Paxos at war. Technical Report UCAM-CL-TR-593, University of Cambridge, 2004.

Cited By

Tseng LLiang GVaidya N(2024)Iterative approximate Byzantine consensus in arbitrary directed graphsDistributed Computing10.1007/s00446-024-00468-237:3(225-246)Online publication date: 22-May-2024
https://dl.acm.org/doi/10.1007/s00446-024-00468-2
Bravo MChockler GGotsman A(2024)Liveness and latency of Byzantine state-machine replicationDistributed Computing10.1007/s00446-024-00466-437:2(177-205)Online publication date: 3-May-2024
https://doi.org/10.1007/s00446-024-00466-4
Jing GZou YYu DLuo CCheng X(2023)Efficient Fault-Tolerant Consensus for Collaborative Services in Edge ComputingIEEE Transactions on Computers10.1109/TC.2023.323813872:8(2139-2150)Online publication date: 1-Aug-2023
https://doi.org/10.1109/TC.2023.3238138
Show More Cited By

Index Terms

Tolerating corrupted communication

Recommendations

Reliability Measure of Hardware Redundancy Fault-Tolerant Digital Systems with Intermittent Faults

While significant results are available which allow estimation of reliability measure for systems with permanent faults, no generally applicable results are available for intermittent (transient) faults. Methods are presented here which allow ...
Relyzer: exploiting application-level fault equivalence to analyze application resiliency to transient faults
ASPLOS XVII: Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems

Future microprocessors need low-cost solutions for reliable operation in the presence of failure-prone devices. A promising approach is to detect hardware faults by deploying low-cost monitors of software-level symptoms of such faults. Recently, ...
Formal development of mechanisms for tolerating transient faults
Rigorous Development of Complex Fault-Tolerant Systems

Transient faults belong to a wide-spread class of faults typical for control systems. These are the faults that only appear for a short period of time and might reappear later. However, even by appearing for a short time, they might cause dangerous ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing

August 2007

424 pages

ISBN:9781595936165

DOI:10.1145/1281100

General Chair:
Indranil Gupta
UIUC, USA
,
Program Chair:
Rogert Wattenhofer
ETH Zurich, Switzerland

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 August 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PODC07

Sponsor:

PODC07: ACM Symposium on Principles of Distributed Computing 2007

August 12 - 15, 2007

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

41
Total Citations
View Citations
505
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Tseng LLiang GVaidya N(2024)Iterative approximate Byzantine consensus in arbitrary directed graphsDistributed Computing10.1007/s00446-024-00468-237:3(225-246)Online publication date: 22-May-2024
https://dl.acm.org/doi/10.1007/s00446-024-00468-2
Bravo MChockler GGotsman A(2024)Liveness and latency of Byzantine state-machine replicationDistributed Computing10.1007/s00446-024-00466-437:2(177-205)Online publication date: 3-May-2024
https://doi.org/10.1007/s00446-024-00466-4
Jing GZou YYu DLuo CCheng X(2023)Efficient Fault-Tolerant Consensus for Collaborative Services in Edge ComputingIEEE Transactions on Computers10.1109/TC.2023.323813872:8(2139-2150)Online publication date: 1-Aug-2023
https://doi.org/10.1109/TC.2023.3238138
Zhai SLi XGe NGrundy J(2023)HOME: Heard-of Based Formal Modeling and Verification Environment for Consensus ProtocolsProceedings of the 45th International Conference on Software Engineering: Companion Proceedings10.1109/ICSE-Companion58688.2023.00016(16-20)Online publication date: 14-May-2023
https://dl.acm.org/doi/10.1109/ICSE-Companion58688.2023.00016
Bravo MChockler GGotsman A(2022)Making Byzantine consensus liveDistributed Computing10.1007/s00446-022-00432-y35:6(503-532)Online publication date: 2-Sep-2022
https://doi.org/10.1007/s00446-022-00432-y
Ganjei ZRezine AEles PPeng Z(2021)Verifying Safety of Parameterized Heard-Of AlgorithmsNetworked Systems10.1007/978-3-030-67087-0_14(209-226)Online publication date: 14-Jan-2021
https://doi.org/10.1007/978-3-030-67087-0_14
Drăgoi CWidder JZufferey D(2020)Programming at the edge of synchronyProceedings of the ACM on Programming Languages10.1145/34282814:OOPSLA(1-30)Online publication date: 13-Nov-2020
https://dl.acm.org/doi/10.1145/3428281
Wanner JChuat LPerrig A(2020)A Formally Verified Protocol for Log Replication with Byzantine Fault Tolerance2020 International Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS51746.2020.00018(101-112)Online publication date: Sep-2020
https://doi.org/10.1109/SRDS51746.2020.00018
Kawahara R(2020)Verification of customizable blockchain consensus rule using a formal method2020 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)10.1109/ICBC48266.2020.9169472(1-3)Online publication date: May-2020
https://doi.org/10.1109/ICBC48266.2020.9169472
Ghilardi SPagani E(2020)Higher-Order Quantifier Elimination, Counter Simulations and Fault-Tolerant SystemsJournal of Automated Reasoning10.1007/s10817-020-09578-5Online publication date: 29-Aug-2020
https://doi.org/10.1007/s10817-020-09578-5
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten