4 articles for “Byzantine agreement”

Set a search alert

Research ArticleOpen accessPhrase in the titleProactive and Reactive View Change for Fault Tolerant Byzantine AgreementPoonam Saini, Awadhesh Kumar SinghProblem statement: Dealing with arbitrary failures effectively, while reaching agreement, remains a major operational challenge in distributed transactions. In the contemporary literature, standard protocols such as Byzantine Fault Tolerant Distributed Commit and Practical Byzantine Fault Tolerance handles the problem to a greater extent. However, the limitation with these protocols is that they incur increased message overhead as well as large … …Journal of Computer Science, Vol. 7, Issue 1 · 15 Jan 2011 · 7,048 accessesView PDF Cite

Research ArticleOpen accessPhrase in the titleAspect Oriented Decision Making Model for Byzantine AgreementS. Murugan, V. RamachandranProblem statement: The main aim of this research study is to develop an enhanced strategy for decision making whether to commit or rollback a request to a Web service in the presence of Byzantine faults using aspects. The proposed study extends the Lamport’s algorithm for Byzantine agreement to have an effective decision while handling the service request. When the service … …Journal of Computer Science, Vol. 8, Issue 3 · 16 Jan 2012 · 7,034 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsFault-tolerant Distributed Systems with Diagnostics AlgorithmsOleg Viktorov, Afif MghawishTo 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 … …Journal of Computer Science, Vol. 1, Issue 2 · 19 Oct 2005 · 4,840 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA Robust Byzantine Fault-Tolerant Replication Technique for Peer-to-Peer Content DistributionAyyasamy Sellappan, Sivanandam NatarajanProblem statement: In peer-to-peer networks, Byzantine fault tolerance refers to the capability of a system to tolerate Byzantine faults. It can be achieved by replicating the server and by ensuring all server replicas reach an agreement on the input despite Byzantine faulty replicas and clients. Since malicious attacks and software errors can cause faulty nodes to exhibit Byzantine behavior, Byzantine-fault-tolerant … …Journal of Computer Science, Vol. 7, Issue 2 · 25 Feb 2011 · 7,056 accessesView PDF Cite