scholarly journals CORBA Replication Support for Fault-Tolerance in a Partitionable Distributed System

2006 ◽  
Author(s):  
S. Beyer ◽  
F.D. Munoz-Escoi ◽  
P. Galdamez
Keyword(s):  
Fault Tolerance ◽  
Distributed System

MobileRE: A replicas prioritized hybrid fault tolerance strategy for mobile distributed system

2021 ◽  
pp. 102217
Author(s):  
Yu Wu ◽  
Duo Liu ◽  
Xianzhang Chen ◽  
Jinting Ren ◽  
Renping Liu ◽  
...  
Keyword(s):  
Fault Tolerance ◽  
Distributed System ◽  
Tolerance Strategy

scholarly journals CONSISTENCY OF DISTRIBUTED SYSTEM WITH ACTIVE INITIATOR PROCESS WITHOUT USELESS CHECKPOINTS

2014 ◽  
pp. 92-99
Author(s):  
N. P. Gopalan ◽  
K. Nagarajan
Keyword(s):  
Fault Tolerance ◽  
Distributed System ◽  
Message Passing ◽  
Domino Effect ◽  
Exchange Of Information ◽  
Global Consistency ◽  
Software Fault Tolerance ◽  
Software Fault ◽  
The One ◽  
Active Initiator

Checkpointing mechanism is the one of the best attractive approach for providing software fault tolerance in distributed message passing systems. This paper aims to implement a distributed checkpointing technique, which eliminates the drawbacks of the centralized approach like “domino effect”, “useless checkpoint” (checkpoints that do not contribute to global consistency), and “hidden and zigzag” dependencies. The proposed checkpointing protocol has a checkpoint initiator, but, coordination among the local checkpoints is done in a distributed fashion. This guaranty that no message would be lost in case of failure occurs, has been maintained in this work by exchange of information among the processes. However, there is no central checkpoint initiator, but each of the processes takes turn to act as an initiator. Processes take local checkpoints only after being notified by the initiator. The processes synchronize their activities of the current checkpointing interval before finally committing their checkpoints. Thus, the checkpointing pattern described in this paper takes only those checkpoints that will contribute to the consistent global snapshot thereby eliminating the number of useless checkpoints.

scholarly journals State of Art Survey for Fault Tolerance Feasibility in Distributed Systems

2021 ◽  
pp. 19-34
Author(s):  
Arshad A. Hussein ◽  
Adel AL-zebari ◽  
Naaman Omar ◽  
Karwan Jameel Merceedi ◽  
Abdulraheem Jamil Ahmed ◽  
...  
Keyword(s):  
Distributed Systems ◽  
Fault Tolerance ◽  
Distributed System ◽  
Recent Literature ◽  
High Availability ◽  
Daily Activities ◽  
Service Availability ◽  
System Failures ◽  
Distributed Services ◽  
Use Of Technology

The use of technology has grown dramatically, and computer systems are now interconnected via various communication mediums. The use of distributed systems (DS) in our daily activities has only gotten better with data distributions. This is due to the fact that distributed systems allow nodes to arrange and share their resources across linked systems or devices, allowing humans to be integrated with geographically spread computer capacity. Due to multiple system failures at multiple failure points, distributed systems may result in a lack of service availability. to avoid multiple system failures at multiple failure points by using fault tolerance (FT) techniques in distributed systems to ensure replication, high redundancy, and high availability of distributed services. In this paper shows ease fault tolerance systems, its requirements, and explain about distributed system. Also, discuss distributed system architecture; furthermore, explain used techniques of fault tolerance, in additional that review some recent literature on fault tolerance in distributed systems and finally, discuss and compare the fault tolerance literature.

scholarly journals Análise de Segurança dos Mecanismos de Consenso no PBFT usando Multichain e PoW usando Ethereum Aplicados em Redes Blockchain Privadas/Consórcio

2020 ◽  
Author(s):  
João Battisti ◽  
Maurício Pillon ◽  
Guilherme Koslovski ◽  
Charles Miers
Keyword(s):  
Fault Tolerance ◽  
Distributed System ◽  
Denial Of Service ◽  
Byzantine Fault Tolerance ◽  
P2p Networks ◽  
Byzantine Fault ◽  
Technological Advances ◽  
Encryption Algorithms

A considerable number of electronic transaction systems employ classicapproaches based on centralized trust mechanisms, not exploitingthe latest technological advances. Alternatively, the concept ofblockchain stands out, elaborated without the need for this centralizedtrust, but rather dependent on securely chained technologies in whichthe elements involved can conduct secure negotiations. Blockchain isdesigned to address security and distributed system issues through theuse of encryption, algorithms, P2P networks, and consensus mechanisms.This paper presents a Denial of Service (DoS) security analysisof the more traditional Practical Byzantine Fault Tolerance (PBFT)and Proof of Work (PoW) consensus mechanisms available onMultichain and Ethereum solutions based on a private / consortiumblockchain scenario. We present our results of a controlled DoSattack, revealing the importance and need for security-relatedanalysis of blockchain implementations of private / consortiumblockchains.

scholarly journals Fault Tolerance in Real Time Distributed System

2018 ◽  
Vol 5 (2) ◽  
pp. 20-24 ◽  
Author(s):  
Gajendra Sharma ◽  
Ankita Yadav
Keyword(s):  
Fault Tolerance ◽  
Real Time ◽  
Distributed System

scholarly journals Transient-Snapshot based Minimum-process Synchronized Check pointing Etiquette for Mobile Distributed Systems

2021 ◽  
Vol 10 (4) ◽  
pp. 2861-2866
Keyword(s):  
Distributed Systems ◽  
Fault Tolerance ◽  
Distributed System ◽  
Mobile Systems ◽  
Message Complexity ◽  
In The Beginning ◽  
Bare Minimum

Minimum-process harmonized checkpointing is well thought-out an attractive methodology to acquaint with fault tolerance in mobile systems patently. We design a minimum- process synchronous checkpointing algorithm for mobile distributed system. We try to minimize the intrusion of processes during checkpointing. We collect the transitive dependencies in the beginning, and therefore, the obstructive time of processes is bare minimum. During obstructive period, processes can do their normal computations, send messages and can process selective messages. In case of failure during checkpointing, all applicable processes are necessitated to abandon their transient snapshots only. In this way, we try to reduce the loss of checkpointing effort when any process fails to take its checkpoint in coordination with others. We also try to minimize the harmonization message complexity during checkpointing.

Sign in / Sign up

Export Citation Format

Share Document