Filters








3,912 Hits in 4.6 sec

Page 8157 of Mathematical Reviews Vol. , Issue 2004j [page]

2004 Mathematical Reviews  
Most BA protocols require all the fault-free pro- cessors to reach a common agreement at the same round, called an immediate Byzantine agreement (IBA), whereas another type of BA protocol allows the fault-free  ...  We also show conditional timing properties of the algorithm, giving timebounds for group formation under certain stability conditions.” 2004j:68031 68M14 68M12 Layuan, Li [Li, La Yuan] (PRC-WHUT-C; Wuhan  ... 

Method for distributed transaction commit and recovery using Byzantine Agreement within clusters of processors

C. Mohan, R. Strong, S. Finkelstein
1983 Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83  
This paper describes art application of Byzantine Agreement [DoSt82a, DoSt82c, LyFF82] to distributed transaction commit.  ...  time of recovery from failure.  ...  failures of various types the algorithm can tolerate.  ... 
doi:10.1145/800221.806712 dblp:conf/podc/MohanSF83 fatcat:53kbhrgdgvdxvf2vjrhfow5okq

Scalable byzantine computation

Valerie King, Jared Saia
2010 ACM SIGACT News  
Byzantine agreement is arguably one of the most fundamental problems in distributed computing.  ...  After almost 30 years of research on Byzantine Agreement (BA), the problem continues to be relevant and to re-invent itself in new ways.  ...  I would like to thank Christian Cachin, Robert Haas and Rachid Guerraoui for their valuable comments and many interesting discussions.  ... 
doi:10.1145/1855118.1855136 fatcat:rguixn4g7rfxxam474upudq6mu

Elections in the presence of faults

Michael Merritt
1984 Proceedings of the third annual ACM symposium on Principles of distributed computing - PODC '84  
When there is only one voter, these requirements are those for Byzantine Agreement on the voter's value, with the restriction that agreement be reached in at most k+l rounds, and with the addition of '  ...  We consider protocols which are resistant to three different types of failures: two types of Stopping-Faults, in which failed processors behave correctly until failure and then halt permanently, and Byzantine  ... 
doi:10.1145/800222.806741 dblp:conf/podc/Merritt84 fatcat:yr3ysfc4o5gpdpkw3h5iie6myu

Recent Results on Fault-Tolerant Consensus in Message-Passing Networks [article]

Lewis Tseng
2016 arXiv   pre-print
We also discuss Bitcoin, which can be related to solving Byzantine consensus in anonymous systems, and compare Bitcoin with BFT systems and Byzantine consensus.  ...  Fault-tolerant consensus has been studied extensively in the literature, because it is one of the most important distributed primitives and has wide applications in practice.  ...  Vaidya for early feedback and Michel Raynal for pointers to several new works. References [1] Apache zookeeper on windows azure. https://msopentech.com/opentech-projects/apache-zookeeper-o  ... 
arXiv:1608.07923v1 fatcat:6cqh3mlijrb3vgcbio2j2j3sju

Two New Protocols for Fault Tolerant Agreement

Poonam Saini, Awadhesh Kumar Singh
2011 International Journal of Distributed and Parallel systems  
We propose a novel proactive based agreement which identifies the tentative failures in the system.  ...  The paper attempts to handle failures effectively, while reaching agreement, in a distributed transaction processing system.  ...  It works as a failure detector in order to detect crash failure with the required level of accuracy.  ... 
doi:10.5121/ijdps.2011.2101 fatcat:nawmx2dstzbjdil74sod5uwkjm

Iterative Approximate Consensus in the Presence of Byzantine Link Failures [chapter]

Lewis Tseng, Nitin Vaidya
2014 Lecture Notes in Computer Science  
In particular, we prove a tight necessary and sufficient condition on the underlying communication graph for the existence of iterative approximate consensus algorithms under transient Byzantine link model  ...  Recent work has addressed the problem of reaching approximate consensus in incomplete graphs with Byzantine nodes using a restricted class of iterative algorithms that maintain only a small amount of memory  ...  Summary This paper explores approximate consensus problem under transient Byzantine link failure model.  ... 
doi:10.1007/978-3-319-09581-3_7 fatcat:z6qwk3ixknacrbwje4kldvaw3e

Supporting customized failure models for distributed software

Matti A Hiltunen, Vijaykumar Immanuel, Richard D Schlichting
1999 Distributed Systems Engineering  
For example, in terms of the amount of redundancy required and execution time, tolerating a processor crash is much cheaper than tolerating arbitrary (or Byzantine) failures.  ...  This paper describes an approach to constructing configurable services for distributed systems that allows easy customization of the type of failures to tolerate.  ...  This work was supported in part by the Defense Advanced Research Projects Agency under Grant N66001-97-C-8518, the Office of Naval Research under Grant N00014-96-0207, and the National Science Foundation  ... 
doi:10.1088/0967-1846/6/3/302 fatcat:bvgqjkoeyncldbhbpyhuxdt3iu

Synchronous consensus under hybrid process and link failures

Martin Biely, Ulrich Schmid, Bettina Weiss
2011 Theoretical Computer Science  
This dramatically outperforms the ⌊(n − 2)/2⌋ = O(n) resilience of previous work on Byzantine agreement under link failures (see Section 2).  ...  A theoretical study of connectivity requirements for consensus in case of bidirectional links can be found in [44] .  ... 
doi:10.1016/j.tcs.2010.09.032 pmid:22031791 pmcid:PMC3197330 fatcat:tbthngfkrvaclbf5jbsgf5574u

A Flexible Consensus Protocol for Distributed Systems

Chien-Fu Cheng, Kuo-Tang Tsai
2019 IEEE Access  
This paper presents a new type of Consensus problem named the Consensus (n, m) with alternative plans, where n denotes the total number of processors in the network, m is the number of processors with  ...  First, each processor is no longer required to propose an initial value. It can flexibly choose to propose or not propose an initial value.  ...  ACKNOWLEDGMENT This paper was presented in part at the Proceedings of the 2013 IEEE Wireless Communications and Networking Conference (WCNC'13) [24] .  ... 
doi:10.1109/access.2019.2926888 fatcat:6tnsil4obvdq3ffnqzuz5w4ryu

Agreement in synchronous networks with ubiquitous faults

Nicola Santoro, Peter Widmayer
2007 Theoretical Computer Science  
We establish bounds on the number of dynamic faults that make any non-trivial form of agreement (even strong majority) impossible; in turn, these bounds express connectivity requirements that must be met  ...  of non-trivial agreement in complete graphs in the presence of dynamic Byzantine faults.  ...  Zaks for helpful discussions on some of these results over the years; and Yoram Moses and Sergio Rajsbaum for bringing reference [34] to the attention of the mainstream distributed computing community  ... 
doi:10.1016/j.tcs.2007.04.036 fatcat:m5epaw3vanhfhlfrv2pmlvyrkm

Robust distributed computing and sensing algorithm

R.R. Brooks, S.S. Iyengar
1996 Computer  
type of distributed system.  ...  To solve the problem algorithmically, we basically have sensorfusion and Byzantine agreement.  ...  This work was supported in part by the Office of Naval Research, grant N00014-94-1-0343.  ... 
doi:10.1109/2.507632 fatcat:lbo33nkjcfh2plnfpy72qkwvwm

Turquois: Byzantine consensus in wireless ad hoc networks

Henrique Moniz, Nuno Ferreira Neves, Miguel Correia
2010 2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN)  
The failure of some nodes and momentary breakdown of communications, either of accidental or malicious nature, should not result in the failure of the entire system.  ...  The protocol is safe despite the arbitrary failure of f < n 3 processes from a total of n processes, and unrestricted message omissions.  ...  Research on Byzantine fault-tolerant protocols for wireless environments has been practically restricted to broadcasting problems [14, 20, 12, 4, 15] .  ... 
doi:10.1109/dsn.2010.5544268 dblp:conf/dsn/MonizNC10 fatcat:5mgxldgceveshp7kdn2tlje66y

Consensus protocols as a model of trust in blockchains

Auqib Hamid Lone, Roohie Naaz Mir
2019 International Journal of Blockchains and Cryptocurrencies  
Various algorithms can be applied to achieve a consensus based on the requirements like performance, security, scalability, consistency, and failure redundancy.  ...  Creating a global fair decentralised consensus protocol is of prime importance, in order to address above-mentioned requirements sufficiently.  ...  Byzantine failures are most dangerous and difficult to deal class of failures because they do not restrict or make any assumption about the behaviour that nodes take at any point in time.  ... 
doi:10.1504/ijbc.2019.101845 fatcat:qjmjvpxj3jhflgnr2ejuso7p6m

Byzantine Fault-Tolerant Consensus in Wireless Ad Hoc Networks

Henrique Moniz, Nuno F. Neves, Miguel Correia
2013 IEEE Transactions on Mobile Computing  
This paper presents an asynchronous Byzantine consensus protocol -called Turquois -specifically designed for resource-constrained wireless ad hoc networks.  ...  The failure of some nodes and momentary breakdown of communications, either of accidental or malicious nature, should not result in the failure of the entire system.  ...  All these activities require some sort of agreement among the nodes, which has to be performed in a dependable way.  ... 
doi:10.1109/tmc.2012.225 fatcat:dz4vdhu5hzhhbltmucfbzaefyy
« Previous Showing results 1 — 15 out of 3,912 results