Filters








2,470 Hits in 14.1 sec

Application-Aware Byzantine Fault Tolerance [chapter]

2014 Building Dependable Distributed Systems  
Application-aware Byzantine fault tolerance makes it possible to facilitate concurrent processing of requests, to minimize the use of Byzantine agreement, and to identify and control replica nondeterminism  ...  We elaborate the need for exploiting application semantics for Byzantine fault tolerance and the benefits of doing so, provide a classification of various approaches to application-aware Byzantine fault  ...  The message delivery is controlled by a parallelizer component that is sandwiched between the Byzantine agreement layer (for message total ordering) and the server application (referred to as executor  ... 
doi:10.1002/9781118912744.ch8 fatcat:gr27j7cw3zghtispqqotzbfg4u

Application-Aware Byzantine Fault Tolerance

Wenbing Zhao
2014 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing  
Application-aware Byzantine fault tolerance makes it possible to facilitate concurrent processing of requests, to minimize the use of Byzantine agreement, and to identify and control replica nondeterminism  ...  We elaborate the need for exploiting application semantics for Byzantine fault tolerance and the benefits of doing so, provide a classification of various approaches to application-aware Byzantine fault  ...  The message delivery is controlled by a parallelizer component that is sandwiched between the Byzantine agreement layer (for message total ordering) and the server application (referred to as executor  ... 
doi:10.1109/dasc.2014.17 dblp:conf/dasc/Zhao14 fatcat:vf6qbzcmijgwba7dc5dvqqja2q

Fair Byzantine Agreements for Blockchains

Po-Chun Kuo, Hao Chung, Tzu-Wei Chao, Chen-Mou Cheng
2020 IEEE Access  
Last but not least, experimental results show that our Byzantine agreement protocol outperforms a wide variety of state-of-art synchronous protocols, combining the best from both theoretic and practical  ...  First, we propose a new metric, called fair validity, for measuring the performance of Byzantine agreements.  ...  COMMUNICATION COMPLEXITY OF ROBUST BYZANTINE AGREEMENT We now analyze the communication complexity of a single node for a single round in RBA.  ... 
doi:10.1109/access.2020.2986824 fatcat:fam2mcdu7ndcdgsonxz7kckefq

Networks of Trusted Execution Environments for Data Protection in Cooperative Vehicular Systems [chapter]

Philippe Boos, Marc Lacoste
2020 Zenodo  
Both types of protocols reach an intermediate level of security, with variations in byzantine tolerance and types of threats.  ...  Networks of autonomous vehicles roaming in smart cities raise new challenges for end-to-end protection of data in terms of integrity, privacy, efficiency, and scalability.  ...  This work is part of 5GCroCo project funded by the EU H2020 Research and Innovation Programme (grant no. 825050).  ... 
doi:10.5281/zenodo.3949844 fatcat:psp4pu5ofvg5njtwa7bbwwuk5e

Performance optimization for state machine replication based on application semantics: A review

Wenbing Zhao
2016 Journal of Systems and Software  
By incorporating application semantics into fault tolerance design, we could enable concurrent processing of requests, reduce the frequency of distributed agreement operations, and control application  ...  However, state machine replication requires replicas to run deterministically and to process requests sequentially according to a total order.  ...  Acknowledgements I sincerely thank the reviewers for their invaluable suggestions on how to improve an earlier version of this article.  ... 
doi:10.1016/j.jss.2015.11.006 fatcat:huh2xvekvbde5eny2um2ni454i

Challenges of PBFT-Inspired Consensus for Blockchain and Enhancements over Neo dBFT

Igor M. Coelho, Vitor N. Coelho, Rodolfo P. Araujo, Wang Y. Qiang, Brett D. Rhodes
2020 Future Internet  
Blockchain technology has seen the introduction of different sorts of consensus mechanism, ranging from tasks of heavy computation to the subtle mathematical proofs of Byzantine agreements.  ...  Consensus mechanisms are a core feature for handling negotiation and agreements.  ...  Complex attack on dBFT 2.0+, where replica R 2 is malicious. Byzantine R 2 helps R 0 commit, and then it assumes new proposal #H .  ... 
doi:10.3390/fi12080129 fatcat:hk63eean5ndc7jricbzvtdgs5y

Interactive Consistency in Practical, Mostly-Asynchronous Systems

Panos Diamantopoulos, Stathis Maneas, Christos Patsonakis, Nikos Chondros, Mema Roussopoulos
2015 2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)  
We leverage the vast prior work on broadcast and byzantine consensus algorithms to design, implement and evaluate a set of algorithms, with varying timing assumptions and message complexity, that can be  ...  Previous works assume a fully synchronous system, where one can make strong assumptions such as negligible message delivery delays and/or detection of absent messages.  ...  This work has been partially supported by ERC Starting Grant # 279237 and by the FINER project funded by the Greek Secretariat of Research and Technology under action "ARISTEIA 1".  ... 
doi:10.1109/icpads.2015.99 dblp:conf/icpads/DiamantopoulosM15 fatcat:45qcdyv7rbar7hg7dzlbvs3uoa

Adaptive byzantine fault tolerance support for agent oriented systems: The BDARX

Alvi et al., Department of Computer Science and Information Technology, The University of Lahore, Lahore, Pakistan
2019 International Journal of Advanced and Applied Sciences  
This paper proposes Byzantine DARX (BDARX) architecture which endows DARX with the ability to handle Byzantine faults, and thus it allows the building of complex software systems to deal with arbitrary  ...  faults and make the system more reliable and efficient.  ...  Compliance with ethical standards Conflict of interest The authors declare that they have no conflict of interest.  ... 
doi:10.21833/ijaas.2019.02.009 fatcat:nyjk6mn645hqne473yoz6scw4a

New Approach to Improve the Generalized Byzantine Agreement Problem

Hsieh Hui-Ching, Chiang Mao-Lun
2015 Journal of clean energy technologies  
To achieve reliability, it is very important to study the agreement and fault-tolerance topic in distributed systems. This kind of problem is known as a Byzantine Agreement (BA) problem.  ...  In this study, we propose a novel and efficient protocol to reduce the amount of messages.  ...  Our protocol only requires four rounds of message exchange to reach agreement and the message complexity is O (n 3 ).  ... 
doi:10.7763/ijcte.2015.v7.942 fatcat:vogz3vssnvhr3g3errc2esdeae

Interactive Consistency in practical, mostly-asynchronous systems [article]

Panos Diamantopoulos, Stathis Maneas, Christos Patsonakis, Nikos Chondros, Mema Roussopoulos
2015 arXiv   pre-print
We leverage the vast prior work on broadcast and byzantine consensus algorithms to design, implement and evaluate a set of algorithms, with varying timing assumptions and message complexity, that can be  ...  Previous works assume a fully synchronous system, where one can make strong assumptions such as negligible message delivery delays and/or detection of absent messages.  ...  Agreement algorithms that tolerate byzantine failures of (non-source) nodes in asynchronous systems are presented in [20] and [21] . Byzantine Consensus.  ... 
arXiv:1410.7256v5 fatcat:z4zuvdwzmzblpowv5n2hdxlcdq

A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance

Junya NAKAMURA, Tadashi ARARAGI, Toshimitsu MASUZAWA, Shigeru MASUYAMA
2014 IEICE transactions on information and systems  
In this paper, we also prove the correctness of our method and experimentally compare it with the existing method in terms of latency and throughput.  ...  Junya NAKAMURA †a) , Nonmember, Tadashi ARARAGI † †b) , Toshimitsu MASUZAWA †c) , and Shigeru MASUYAMA † † †d) , Members SUMMARY We propose a new method that accelerates asynchronous Byzantine Fault Tolerant  ...  Kakugawa and Ooshita of Osaka University for their helpful discussions about improving this paper.  ... 
doi:10.1587/transinf.e97.d.53 fatcat:fck7spd47nhvjnxpu6wc66pvuu

SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs [chapter]

Borzoo Bonakdarpour, Sandeep S. Kulkarni
2008 Lecture Notes in Computer Science  
We present the tool Sycraft (SYmboliC synthesizeR and Adder of Fault-Tolerance). In Sycraft, a distributed fault-intolerant program is specified in terms of a set of processes and an invariant.  ...  Each process is specified as a set of actions in a guarded command language, a set of variables that the process can read, and a set of variables that the process can write.  ...  In order to overcome the complexity issues, in a previous work [3] , we developed a set of symbolic heuristics for synthesizing fault-tolerant distributed programs with state space of size 10 50 and beyond  ... 
doi:10.1007/978-3-540-85361-9_16 fatcat:zdblv2nv6bfbpcucfuf3lesgeu

Smart contracts that are smart and can function as legal contracts - A Review of Semantic Blockchain and Distributed Ledger Technologies [article]

Marcelle von Wendland
2018 arXiv   pre-print
One of the biggest challenges though is the level of support for semantics by most of the Block Chain and Distributed Ledger technologies.  ...  This paper reviews and categorises common block chain and DLT approaches and introduces a new approach to Blockchain / DLT promising to resolve the semantic problems inherent in other Blockchain / DLT  ...  Before we examine semantics and how it helps machines determine certainty of meaning we therefore need to examine the need for certainty of agreement The Need for Certainty of Agreement At an intuitive  ... 
arXiv:1805.01279v1 fatcat:pa7g7tcjzfax5iucfvicco3vmm

ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication [article]

Alexander Spiegelman, Arik Rinberg
2019 arXiv   pre-print
To demonstrate the power of ACE, we implement it in C++, instantiate the LBV abstraction with a view implementation of HotStuff – a state of the art partially synchronous byzantine agreement protocol –  ...  ., the ratio and types of faulty parties.  ...  Acknowledgments We thank Ittai Abraham for helpful initial discussions and Dahlia Malkhi for reviewing drafts and suggesting valuable improvements.  ... 
arXiv:1911.10486v1 fatcat:jugoncgjvjd5tadlxaoskwrbvq

Synchronization issues in real-time systems

N. Suri, M.M. Hugue, C.J. Walter
1994 Proceedings of the IEEE  
of a common system-wide time base.  ...  A synchronization primitive i s essential in meeting the demands of real-time critical computing.  ...  The number of Byzantine faults tolerable by a xed round protocol is increased in Perry 18 ] beyond the limits propose by Rabin in 19] .  ... 
doi:10.1109/5.259425 fatcat:7mo3jwihsjhohjm3ovyjntyyj4
« Previous Showing results 1 — 15 out of 2,470 results