research-article

Exploiting Omissive Faults in Synchronous Approximate Agreement

Authors:

M. H. Azadmanesh,

R. M. KieckhaferAuthors Info & Claims

IEEE Transactions on Computers, Volume 49, Issue 10

Pages 1031 - 1042

https://doi.org/10.1109/12.888039

Published: 01 October 2000 Publication History

Abstract

In a fault-tolerant distributed system, it is often necessary for nonfaulty processes to agree on the value of a shared data item. The criterion of Approximate Agreement does not require processes to achieve exact agreement on a value; rather, they need only agree to within a predefined numerical tolerance. Approximate Agreement can be achieved through convergent voting algorithms. Previous research has studied convergent voting algorithms under mixed-mode or hybrid fault models, such as the Thambidurai and Park Hybrid fault model, comprised of three fault modes: asymmetric, symmetric, and benign. This paper makes three major contributions to the state of the art in fault-tolerant convergent voting. 1) We partition both the asymmetric and symmetric fault modes into disjoint omissive and transmissive submodes. The resulting five-mode hybrid fault model is a superset of previous hybrid fault models. 2) We present a new family of voting algorithms, called Omission Mean Subsequence Reduced (OMSR), which implicitly recognize and exploit omissive behavior in malicious faults while still maintaining full Byzantine fault tolerance. 3) We show that OMSR voting algorithms are more fault-tolerant than previous voting algorithms if any of the currently active faults is omissive.

References

[1]

M.H. Azadmanesh and R.M. Kieckhafer, “Synchronous Approximate Agreement in the Presence of Transmissive and Omissive Failure Modes,” Technical Report no. TR-98-01, Dept. of Computer Science, Univ. of Nebraska at Omaha, 1998.

[2]

M.H. Azadmanesh and A.W. Krings, “Egocentric Voting Algorithms,” IEEE Trans. Reliability, vol. 46, no. 4, pp. 494-502, Dec. 1997.

[3]

M.H. Azadmanesh and R.M. Kieckhafer, “New Hybrid Fault Models for Asynchronous Approximate Agreement,” IEEE Trans. Computers, vol. 45, no. 4, pp. 439-449, Apr. 1996.

Digital Library

[4]

M. Barborak and M. Malek, “The Consensus Problem in Fault-Tolerant Computing,” ACM Computing Surveys, vol. 25, no. 2, pp. 172-220, June 1993.

Digital Library

[5]

K. Birman, “Replication and Fault-Tolerance in the ISIS System,” Proc. 10th ACM SIGOPS Symp. Operating Systems Principles, pp. 79-86, Dec. 1985.

Digital Library

[6]

F. Cristian H. Aghili R. Strong and D. Dolev, “Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement,” Proc. 15th Int'l Symp. Fault-Tolerant Computing, pp. 200-206, June 1985.

[7]

F. Cristian H. Aghili and R. Strong, “Clock Synchronization in the Presence of Omission and Performance Faults, and Processor Joins,” Proc. 16th Int'l Conf. Fault-Tolerant Computing, 1986.

[8]

F. Cristian D. Dolev R. Strong and H. Aghili, “Atomic Broadcast in a Real-Time Environment,” IBM Research Report, Almaden Research Center, 1989.

[9]

D. Dolev N.A. Lynch S.S. Pinter E.W. Stark and W.E. Weihl, “Reaching Approximate Agreement in the Presence of Faults,” Proc. Third Symp. Reliability in Distributed Software and Database Systems, pp. 145-154, Oct. 1983.

[10]

D. Dolev N.A. Lynch S.S. Pinter W.E. Stark and E.W. Weihl, “Reaching Approximate Agreement in the Presence of Faults,” J. ACM, vol. 33, no. 3, pp. 499-516, July 1986.

Digital Library

[11]

A.D. Fekete, “Asymptotically Optimal Algorithms for Approximate Agreement,” Distributed Computing, vol. 4, pp. 9-29, 1990.

[12]

J.L.W. Kessels, “Two Designs of a Fault-Tolerant Clocking System,” IEEE Trans. Computers, vol. 33, no. 10, pp. 912-919, Oct. 1984.

Digital Library

[13]

R.M. Kieckhafer C.J. Walter A.M. Finn and P.M. Thambidurai, “The MAFT Architecture for Distributed Fault-Tolerance,” IEEE Trans. Computers, vol. 37, no. 4, pp. 398-405, Apr. 1988.

Digital Library

[14]

R.M. Kieckhafer and M.H. Azadmanesh, “Reaching Approximate Agreement with Mixed Mode Faults,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 53-63, Jan. 1994.

Digital Library

[15]

R.M. Kieckhafer and M.H. Azadmanesh, “Unified Approach to Synchronous and Asynchronous Approximate Agreement in the Presence of Hybrid Faults,” IEEE Trans. Reliability, vol. 44, no. 4, Dec. 1995.

[16]

C.M. Krishna K.G. Shin and R.W. Butler, “Ensuring Fault Tolerance of Phase-Locked Clocks,” IEEE Trans. Computers, vol. 34, no. 8, pp. 752-756, Aug. 1985.

Digital Library

[17]

L. Lamport, et al., “The Byzantine Generals Problem,” ACM TOPLAS, vol. 4, no. 3, pp. 382-401, July 1982.

Digital Library

[18]

L. Lamport and P.M. Melliar-Smith, “Synchronizing Clocks in the Presence of Faults,” J. ACM, vol. 32, no. 1, pp. 52-78, Jan. 1985.

Digital Library

[19]

P. Lincoln and J. Rushby, “The Formal Verification of an Algorithm for Interactive Consistency under a Hybrid Fault Model,” Proc. Fifth Int'l Conf. Computer Aided Verification, pp. 292-304, 1993.

Digital Library

[20]

J. Lundelius and N. Lynch, “A New Fault-Tolerant Algorithm for Clock Synchronization,” Proc. Third Symp. Principles of Distributed Computing, pp. 75-87, Aug. 1984.

Digital Library

[21]

F.J. Meyer and D.K. Pradhan, “Consensus with Dual Failure Modes,” Proc. 17th Fault-Tolerant Computing Symp., pp. 48-54, July 1987.

[22]

M. Pease, et al., “Reaching Agreement in the Presence of Faults,” J. ACM, vol. 27, no. 2, pp. 228-234, Apr. 1980.

Digital Library

[23]

R. Plunkett and A. Fekete, “Approximate Agreement with Mixed Mode Faults,” Proc. 12th Int'l Symp. Distributed Computing, pp. 333-346, Sept. 1998.

Digital Library

[24]

J. Rushby, “A Formally Verified Algorithm for Clock Synchronization under a Hybrid Fault Model,” Proc. 13th ACM Symp. Principles of Distributed Computing, pp. 304-313, 1994.

Digital Library

[25]

F.B. Schneider, “Understanding Protocols for Byzantine Clock Synchronization,” Report No. 87-859, Dept. of Computer Science, Cornell Univ., Aug. 1987.

Digital Library

[26]

N. Suri M. Hugue and C. Walter, “Fault Classification and Distribution Effects on the Reliability Modeling of Large Fault-Tolerant Systems,” Proc. 22nd Fault-Tolerant Computing Symp., pp. 212-220, July 1992.

[27]

P.M. Thambidurai and Y.K. Park, “Interactive Consistency with Multiple Failure Modes,” Proc. Seventh Reliable Distributed Systems Symp., Oct. 1988.

[28]

P. Thambidurai A.M. Finn R.M. Kieckhafer and C.J. Walter, “Clock Synchronization in MAFT,” Proc. 19th Fault-Tolerant Computing Symp., pp. 142-151, June 1989.

[29]

C. Walter M. Hugue and N. Suri, “Continual On-Line Diagnosis of Hybrid Faults,” Dependable Computing for Critical Applications 4, F. Cristian, G. Lann, T. Lunt, eds., pp. 233-250, 1995.

Cited By

Mishra AAzadmanesh A(2021)Global Convergence in Large Sensor Networks under Hybrid FaultsProceedings of the 2021 9th International Conference on Communications and Broadband Networking10.1145/3456415.3456448(201-208)Online publication date: 25-Feb-2021
https://dl.acm.org/doi/10.1145/3456415.3456448
Öksüz HAkar M(2017)Distributed consensus in resilient networks2017 IEEE 56th Annual Conference on Decision and Control (CDC)10.1109/CDC.2017.8264622(6383-6388)Online publication date: 12-Dec-2017
https://dl.acm.org/doi/10.1109/CDC.2017.8264622
Jovanović DDutertre BPiskac RTalupur M(2016)Property-directed k-inductionProceedings of the 16th Conference on Formal Methods in Computer-Aided Design10.5555/3077629.3077648(85-92)Online publication date: 3-Oct-2016
https://dl.acm.org/doi/10.5555/3077629.3077648
Show More Cited By

Index Terms

Exploiting Omissive Faults in Synchronous Approximate Agreement
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
2. Hardware
  1. Hardware test
  2. Robustness

Recommendations

New Hybrid Fault Models for Asynchronous Approximate Agreement

An important problem in fault-tolerant distributed systems is maintaining agreement between nonfaulty processes in the presence of undiagnosed faults. To achieve agreement, processes exchange their local "opinions" of a particular value, and then vote ...
Reaching Approximate Agreement with Mixed-Mode Faults

In a fault-tolerant distributed system, different non-faulty processes may arrive atdifferent values for a given system parameter. To resolve this disagreement, processesmust exchange and vote upon their respective local values. Faulty processes ...
Formally Verified Byzantine Agreement in Presence of Link Faults
ICDCS '02: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)

This paper shows that deterministic consensus in synchronous distributed systems with link faults is possible, despite the impossibility result of (Gray, 1978). Instead of usingrandomization, we overcome this impossibility by moderately restricting the ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 49, Issue 10

October 2000

165 pages

ISSN:0018-9340

Editor:
Jean-Luc Gaudiot
Univ. of Southern California, Los Angels

Issue’s Table of Contents

Copyright © Copyright © 2000 IEEE. All Rights Reserved.

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 October 2000

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Mishra AAzadmanesh A(2021)Global Convergence in Large Sensor Networks under Hybrid FaultsProceedings of the 2021 9th International Conference on Communications and Broadband Networking10.1145/3456415.3456448(201-208)Online publication date: 25-Feb-2021
https://dl.acm.org/doi/10.1145/3456415.3456448
Öksüz HAkar M(2017)Distributed consensus in resilient networks2017 IEEE 56th Annual Conference on Decision and Control (CDC)10.1109/CDC.2017.8264622(6383-6388)Online publication date: 12-Dec-2017
https://dl.acm.org/doi/10.1109/CDC.2017.8264622
Jovanović DDutertre BPiskac RTalupur M(2016)Property-directed k-inductionProceedings of the 16th Conference on Formal Methods in Computer-Aided Design10.5555/3077629.3077648(85-92)Online publication date: 3-Oct-2016
https://dl.acm.org/doi/10.5555/3077629.3077648
Ma Z(2015)Towards computational models of animal communications, an introduction for computer scientistsCognitive Systems Research10.1016/j.cogsys.2014.08.00233:C(70-99)Online publication date: 1-Mar-2015
https://dl.acm.org/doi/10.1016/j.cogsys.2014.08.002
Balogun VKrings A(2013)On the impact of jamming attacks on cooperative spectrum sensing in cognitive radio networksProceedings of the Eighth Annual Cyber Security and Information Intelligence Research Workshop10.1145/2459976.2460011(1-4)Online publication date: 8-Jan-2013
https://dl.acm.org/doi/10.1145/2459976.2460011
Pan ZBreuer M(2012)Error Rate Estimation for Defective Circuits via Ones CountingACM Transactions on Design Automation of Electronic Systems10.1145/2071356.207136417:1(1-14)Online publication date: 1-Jan-2012
https://dl.acm.org/doi/10.1145/2071356.2071364
Tan LKrings A(2011)An adaptive N-variant software architecture for multi-core platformsProceedings of the 2011 international conference on Computational science and its applications - Volume Part II10.5555/2029256.2029297(490-505)Online publication date: 20-Jun-2011
https://dl.acm.org/doi/10.5555/2029256.2029297
Biely MSchmid UWeiss B(2011)Synchronous consensus under hybrid process and link failuresTheoretical Computer Science10.1016/j.tcs.2010.09.032412:40(5602-5630)Online publication date: 1-Sep-2011
https://dl.acm.org/doi/10.1016/j.tcs.2010.09.032
Krings AMuehlbacher-Karrer S(2010)Neighborhood monitoring in ad hoc networksProceedings of the Sixth Annual Workshop on Cyber Security and Information Intelligence Research10.1145/1852666.1852711(1-4)Online publication date: 21-Apr-2010
https://dl.acm.org/doi/10.1145/1852666.1852711
Okun M(2010)Strong order-preserving renaming in the synchronous message passing modelTheoretical Computer Science10.1016/j.tcs.2010.06.001411:40-42(3787-3794)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1016/j.tcs.2010.06.001
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents