Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 19 October 2005

Fault-tolerant Distributed Systems with Diagnostics Algorithms

Oleg Viktorov1 & Afif Mghawish1

Journal of Computer Science, Volume 1, Issue 2, pp. 104–105 · doi.org/10.3844/jcssp.2005.104.105

4,840 accesses2,728 downloads0 citations (Crossref)Metrics
Cite Check for updates

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.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2005 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

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

Licence
© Science Publications
Issue
Volume 1, Issue 2
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Fault-tolerant Distributed Systems with Diagnostics AlgorithmsJournal of Computer Science · Volume 1, Issue 2 · pp. 104–105 · © Science PublicationsDownload