846 Hits in 3.4 sec

Clock Synchronization in the Byzantine-Recovery Failure Model [chapter]

Emmanuelle Anceaume, Carole Delporte-Gallet, Hugues Fauconnier, Michel Hurfin, Josef Widder
Lecture Notes in Computer Science  
We consider the problem of synchronizing clocks in synchronous systems prone to transient and dynamic process failures, i.e., we consider systems where all processes may alternate correct and Byzantine  ...  We propose a clock synchronization algorithm based on periodical resynchronizations which is based on the assumption that no more than f < n/3 processes (with n the number of processors in the system)  ...  This Byzantine-recovery failure model has been previously investigated in [13, 14] (both work will be discussed in Section 6).  ... 
doi:10.1007/978-3-540-77096-1_7 dblp:conf/opodis/AnceaumeDFHW07 fatcat:bggf4qpvnvcbbggxv2afgw7eay

Resilient Intrusion Tolerance through Proactive and Reactive Recovery

Paulo Sousa, Alysson Neves Bessani, Miguel Correia, Nuno Ferreira Neves, Paulo Verissimo
2007 13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)  
This work proposes the combination of proactive and reactive recovery in order to increase the  ...  We design a proactivereactive recovery service based on a hybrid distributed system model and show, as a case study, how this service can effectively be used to augment the resilience of an intrusion-tolerant  ...  One should note that all of these services can be easily implemented in the crash-failure synchronous distributed system model [28] .  ... 
doi:10.1109/prdc.2007.52 dblp:conf/prdc/SousaBCNV07 fatcat:pgbo54dczndedao5jcdpsfbauq

Linear Time Byzantine Self-Stabilizing Clock Synchronization [chapter]

Ariel Daliot, Danny Dolev, Hanna Parnas
2004 Lecture Notes in Computer Science  
In these solutions this is fulfilled or aided by having the clocks initially close to each other and thus the actual clock values can be used for synchronizing the events.  ...  In contrast, current Byzantine self-stabilizing clock synchronization algorithms have exponential convergence time and are thus impractical.  ...  Introduction Overcoming failures that are not predictable in advance is most suitably addressed by tolerating Byzantine faults.  ... 
doi:10.1007/978-3-540-27860-3_4 fatcat:4xqnsyr3grdudk3ck7tbd3ajne

A Comprehensive Study on Failure Detectors of Distributed Systems

Bhavana Chaurasia, Anshul Verma
2020 Journal of scientific research  
In distributed systems, failure detectors are used to monitor the processes and to reduce the risk of failures by detecting them before system crashes.  ...  In this paper various failure detector algorithms are discussed.  ...  The crash-recovery model is an advanced version of the crash failure model in which a crashed process can be recovered.  ... 
doi:10.37398/jsr.2020.640235 fatcat:znckxyrnnnf3npesjkjtifjde4

Vulnerability Analysis of Time Synchronization in Automotive Ethernet [article]

Rishikesh Kakade, Joey Chou, Shannon Torcato
2022 arXiv   pre-print
This paper presents an analysis of failure modes affecting the ability of in-vehicle automotive ethernet networks to synchronize clocks between ECUs.  ...  The time synchronization protocol in this standard is IEEE 802.1 AS which was initially developed for virtual and virtual bridge local area networks (LANs).  ...  ACKNOWLEDGMENT The authors would like to thank Prof. Otman Basir for giving the time and resources to choose and develop our ideas into this report.  ... 
arXiv:2208.11878v1 fatcat:7wqhzvnearb7pl6ygcrjeg5gsu

Fault-tolerant Distributed Systems in Hardware

Danny Dolev, Matthias Függer, Christoph Lenzen, Ulrich Schmid, Andreas Steininger
2015 Bulletin of the European Association for Theoretical Computer Science  
failures.  ...  Very large-scale integrated (VLSI) hardware designs can be seen as distributed systems at several levels of abstraction: from the cores in a multicore architecture down to the Boolean gates in its circuit  ...  In the severe failure model considered in this article, this fundamental problem was first studied by S. Dolev and Welch [35, 36] .  ... 
dblp:journals/eatcs/DolevFLSS15 fatcat:lkyml64cujhdfdblc2qcboenby

Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks [chapter]

Ariel Daliot, Danny Dolev, Hanna Parnas
2003 Lecture Notes in Computer Science  
The algorithm attains near optimal synchronization tightness while tolerating up to a third of the nodes exhibiting Byzantine behavior concurrently.  ...  We define the "Pulse Synchronization" problem that requires nodes to achieve tight synchronization of regular pulse events, in the settings of distributed computing systems.  ...  The algorithm is Byzantine self-stabilizing and thus copes with a more severe fault model than the traditional Byzantine fault models.  ... 
doi:10.1007/3-540-45032-7_3 fatcat:jl27hvf7sfcmvn5zrgdio2imwi

Mechanical verification of a generalized protocol for Byzantine fault tolerant clock synchronization [chapter]

Natarajan Shankar
1992 Lecture Notes in Computer Science  
Schneider Sch87 generalizes a number of protocols for Byzantine faulttolerant clock synchronization and presents a uniform proof for their correctness.  ...  The mechanically checked proofs include the veri cation that the egocentric mean function used in Lamport and Melliar-Smith's Interactive Convergence Algorithm LMS85 satis es the requirements of Schneider's  ...  We compare these approaches in Section 6. Rushby Rus91 uses Ehdm to model and verify fault masking and recovery in a synchronous N-plex system for fault-tolerance.  ... 
doi:10.1007/3-540-55092-5_12 fatcat:hsnrni7qsnbqpptq7e7wgigkfa

A Fault-Tolerant Schema for Clock Synchronization and data aggregation in WSN

Na Wang, Haihui He, DongQian Liu
2013 International Journal of Networked and Distributed Computing (IJNDC)  
Also, an improved HRTS algorithm named T-HRTS which based on Hierarchy Referencing Clock Synchronization resolving the byzantine general problem will be introduced.  ...  Event monitoring and determination is a popular application in WSN.  ...  And thanks for the discussing and instruction of professor Yixiang Chen.  ... 
doi:10.2991/ijndc.2013.1.1.6 fatcat:u2g6clhcgjfp3b375zavmzozka

Fair Byzantine Agreements for Blockchains

Po-Chun Kuo, Hao Chung, Tzu-Wei Chao, Chen-Mou Cheng
2020 IEEE Access  
We then show that any Byzantine agreement could not achieve fair validity in an asynchronous network, so we will focus on synchronous protocols.  ...  Secondly, the protocol should be able to resist network failures, such as cloud services shutdown, while maintaining high performance otherwise. We address these two critical issues in this paper.  ...  . 2) SYNCHRONOUS AND ASYNCHRONOUS NETWORK An extensive literature has studied Byzantine agreement in different network models.  ... 
doi:10.1109/access.2020.2986824 fatcat:fam2mcdu7ndcdgsonxz7kckefq

Intro-Stabilizing Byzantine Clock Synchronization in Heterogeneous IoT Networks [article]

Shaolin Yu, Jihong Zhu, Jiali Yang, Wei Lu
2022 arXiv   pre-print
For reaching dependable high-precision clock synchronization (CS) upon IoT networks, the distributed CS paradigm adopted in ultra-high reliable systems and the master-slave CS paradigm adopted in high-performance  ...  With these, the proposed intro-stabilizing Byzantine CS solution can establish and maintain synchronization with arbitrary initial states in the presence of permanent Byzantine faults.  ...  Comparing with the experimental results [66] , the Byzantine faults are more safely handled with the reduced simulation model.  ... 
arXiv:2203.09969v1 fatcat:yqoi2wezlfczfirnimhhcyit4m

Highly Available Intrusion-Tolerant Services with Proactive-Reactive Recovery

Paulo Sousa, Alysson Neves Bessani, Miguel Correia, Nuno Ferreira Neves, Paulo Verissimo
2010 IEEE Transactions on Parallel and Distributed Systems  
In the past, some research has been done on how to use proactive recovery to build intrusion-tolerant replicated systems that are resilient to any number of faults, as long as recoveries are faster than  ...  We design a proactive-reactive recovery service based on a hybrid distributed system model and show, as a case study, how this service can effectively be used to increase the resilience of an intrusion-tolerant  ...  ACKNOWLEDGMENTS The authors thank the anonymous referees for their helpful comments. This work was partially supported by the EC  ... 
doi:10.1109/tpds.2009.83 fatcat:ifpcnszayvhdhfksgzadz3jsae

Efficient Construction of Global Time in SoCs Despite Arbitrary Faults

Christoph Lenzen, Matthias Fugger, Markus Hofstatter, Ulrich Schmid
2013 2013 Euromicro Conference on Digital System Design  
In this paper, we show how to build synchronized clocks of arbitrary size atop of existing small-sized clocks, despite arbitrary faults.  ...  It involves a reduction to Byzantine fault-tolerant consensus, which allows different consensus algorithms to be plugged in for matching the actual clock sizes and resilience requirements best.  ...  1 Recast in NoC terminology, we assume a flit size equal to the phit size = B, i.e., we send only B bits per cycle (= round in our terminology).  ... 
doi:10.1109/dsd.2013.97 dblp:conf/dsd/LenzenFHS13 fatcat:nmqzfua3tnen7klsxeqlrn4i6i

The FOREVER service for fault/intrusion removal

Paulo Sousa, Alysson Neves Bessani, Rafael R. Obelheiro
2008 Proceedings of the 2nd workshop on Recent advances on intrusiton-tolerant systems - WRAITS '08  
The main objective of FOREVER is to remove faults and intrusions that may happen during system execution, and such removal is done by combining both evolution and recovery techniques.  ...  The paper presents (i.) the challenges that systems exposed to malicious attacks need to address, and (ii.) how FOREVER can be used to tackle these challenges.  ...  In fact each FOREVER monitor monitors each other and, when one is detected to be faulty, the whole replica is considered to be faulty 1 . • Clock Synchronization: All local wormholes have synchronized  ... 
doi:10.1145/1413901.1413906 fatcat:z6yht76zxrb3fhe4gvmjonxxyu

Fault-Tolerant Adaptive Parallel and Distributed Simulation

Gabriele DAngelo, Stefano Ferretti, Moreno Marzolla, Lorenzo Armaroli
2016 2016 IEEE/ACM 20th International Symposium on Distributed Simulation and Real Time Applications (DS-RT)  
This allows the simulation to tolerate crash-failures of computing nodes; furthermore, FT-GAIA offers some protection against byzantine failures since synchronization messages are replicated as well, so  ...  Despite improvements in manufacturing processes, failures of some components are frequent, and the situation will get worse as larger systems are built.  ...  This reduces the workload on the PEs, reducing the wall-clock execution time of the simulation model. Handling Byzantine Failures: Byzantine failures include all types of abnormal behaviors of a PE.  ... 
doi:10.1109/ds-rt.2016.11 dblp:conf/dsrt/DAngeloFMA16 fatcat:wizup5fxnfct3eaa6odvfq6yve
« Previous Showing results 1 — 15 out of 846 results