JCS Cover
Frequency: Monthly
ISSN: 1549-3636 (Print)
ISSN: 1552-6607 (Online)
Research Article Open Access

Fault-tolerant Distributed Systems with Diagnostics Algorithms

Oleg Viktorov1 and Afif Mghawish1
  • 1 Al-Zaytoonah University, Jordan

Abstract

To provide consistent actions in distributed systems with faulty nodes the Byzantine agreement protocol (algorithm) is widely used. In case of using message exchange scheme without authentication the Byzantine agreement algorithm leads to agreement if the number of nodes doesn’t exceed 1/3 of the total number. The proposed algorithms based on diagnostics procedures are used to reach an agreement in distributed models with 2n+ 2 nodes and fewer than k failed nodes. The hierarchical diagnostic procedures give the possibility to vary the complexity of hardware and software overhead according to required level of fault-tolerance.

Journal of Computer Science
Volume 1 No. 2, 2005, 104-105

DOI: https://doi.org/10.3844/jcssp.2005.104.105

Published On: 19 October 2005

How to Cite: Viktorov, O. & Mghawish, A. (2005). Fault-tolerant Distributed Systems with Diagnostics Algorithms. Journal of Computer Science, 1(2), 104-105. https://doi.org/10.3844/jcssp.2005.104.105

Open AccessCopyright: © 2005 Oleg Viktorov and Afif Mghawish. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

  • 1,530 Views
  • 767 Downloads
  • 0 Citations

Download

Keywords

  • Distributed systems
  • nodes
  • Byzantine agreement
  • protocol
  • fail-free system
  • multistage voting scheme
  • consensus actions
  • authentication
  • general
  • lieutenant
  • tester
  • traitor
  • malicious node behavior