A Membership Agreement Algorithm Detecting and Tolerating Asymmetric Timing Faults

  • Håkan Sivencrona
  • Mattias Persson
  • Jan Torin
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 150)


Our paper presents a new membership agreement algorithm that address asymmetric timing faults and includes a new tool simulating TTP/C clusters. The proposed algorithm flags deviating or slightly untimely messages to assure that single marginal transmitting faults are detected and that only the faulty node will be expelled. The tool can demonstrate the behavior of membership agreement algorithms such as the original TTP-C1 algorithm or our modified flagging algorithm. The performed simulations use experimental results from heavy-ion fault injection logged timing faults. The gathered results show the rare faults, which made a network using the original algorithm either collapse or become degraded, are detected and handled with the new algorithm without loss of more than the faulty node.

Key words

Membership agreement Asymmetric timing faults Fault detection 


  1. 1.
    H. Sivencrona, P. Johannessen, M. Persson and J. Torin, Heavy-ion Fault Injection in the Time-triggered Communication Protocol. Proc. First Latin American Symposium on Dependable Computing (LADC03), São Paulo, Brazil, October (2003).Google Scholar
  2. 3.
    H. Kopetz, TTP/C Protocol, Available at (1999).
  3. 4.
    K. Driscoll, B. Hall, H. Sivencrona and P. Zumsteg, Byzantine Fault Tolerance, from Theory to Reality. Proc. 22nd International Conference on Computer Safety, Reliability and Security (SAFECOMP03), pp. 235–248, Edinburgh, Scotland, UK, October 2003.Google Scholar
  4. 5.
    J. Rushby, Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms, IEEE Transactions on Software Engineering, Volume 25, Number 5, September, pp: 651–660, (1999).CrossRefGoogle Scholar
  5. 6.
    A. Ademaj, H. Sivencrona, G. Bauer and J. Torin, Evaluation of Fault Handling of the Time-Triggered Architecture with Bus and Star Topology. Proc. International Conference on Dependable Systems and Networks (DSN 2003), pp. 123–132, San Francisco, USA, (2003).Google Scholar
  6. 7.
    K. Hoyme and K. Driscoll, SAFEbus. Proc. Digital Avionics Systems Conference (AIAA-11), pp. 68–73, Seattle, WA, USA, (1992).Google Scholar
  7. 8.
    H. Kopetz, G. Grünsteidl and J. Reisinger, Fault-Tolerant Membership Service in a Synchronous Distributed Real-Time System, in Dependable Computing for Critical Applications, pp. 411–429, Springer-Verlag, Vienna, Austria, (1991).Google Scholar
  8. 9.
    H. Kopetz and W. Ochsenreiter, Clock Synchronization in Distributed Real-Time Systems, IEEE Transactions on Computers. Vol. 36, Nr. 8, pp. 933–940, (1987).Google Scholar
  9. 10.
    G. Bauer and M. Paulitsch, An Investigation of Membership and Clique Avoidance in TTP/C, Proc. of the 19th IEEE Symposium on Reliable Distributed Systems, pp. 118–124, Nuremberg, Germany, (2000).Google Scholar
  10. 11.
    A. Merceron, Proving “no Cliques” in a Protocol, Computer Science Conference, (ACSC 2001), Proc. 24th Australasian, pp: 134–139, (2001).Google Scholar
  11. 12.
    L. Lamport, R. Shostak and M. Pease, The Byzantine generals problem, ACM Transactions on Programming Languages and Systems, vol. 4 issue 3, pp. 382–401, (1982).CrossRefGoogle Scholar
  12. 13.
    L. Gong, P. Lincoln and J. Rushby, Byzantine Agreement with Authentication: Observations and Applications in Tolerating Hybrid and Link Faults. Proc. Dependable Computing for Critical Applications (DCCA-5), volume 10 of Dependable Computing and Fault Tolerant Systems, pp. 139–157. IEEE Computer Society, (1995).Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2004

Authors and Affiliations

  • Håkan Sivencrona
    • 1
  • Mattias Persson
    • 2
  • Jan Torin
    • 2
  1. 1.Software ElectronicsSP Swedish National Testing and Research InstituteBoråsSweden
  2. 2.Department of Computer EngineeringChalmers University of TechnologyGöteborgSweden

Personalised recommendations