Transparent three-phase Byzantine fault tolerance for parallel and distributed simulations

Li, Zengxiang; Cai, Wentong; Turner, Stephen J.; Qin, Zheng; Goh, Rick Siow Mong

doi:10.1016/j.simpat.2015.09.012

Cited by 2 publications

(2 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A slightly different approach is proposed in [26]. In which, the authors introduce the Fault Tolerant Recently, in [27] the authors proposed a transparent middleware for dealing with Byzantine fault in HLAbased parallel and distributed simulations. In this case, the solution is based on the usage of replication, checkpointing and message logging technologies.…”

Section: Checkpointingmentioning

confidence: 99%

Fault tolerant adaptive parallel and distributed simulation through functional replication

D’Angelo

Ferretti

Marzolla

2019

Simulation Modelling Practice and Theory

View full text Add to dashboard Cite

This paper presents FT-GAIA, a software-based fault-tolerant parallel and distributed simulation middleware. FT-GAIA has being designed to reliably handle Parallel And Distributed Simulation (PADS) models, which are needed to properly simulate and analyze complex systems arising in any kind of scientific or engineering field. PADS takes advantage of multiple execution units run in multicore processors, cluster of workstations or HPC systems. However, large computing systems, such as HPC systems that include hundreds of thousands of computing nodes, have to handle frequent failures of some components. To cope with this issue, FT-GAIA transparently replicates simulation entities and distributes them on multiple execution nodes. This allows the simulation to tolerate crash-failures of computing nodes. Moreover, FT-GAIA offers some protection against Byzantine failures, since interaction messages among the simulated entities are replicated as well, so that the receiving entity can identify and discard corrupted messages. Results from an analytical model and from an experimental evaluation show that FT-GAIA provides a high degree of fault tolerance, at the cost of a moderate increase in the computational load of the execution units.

show abstract

Section: Checkpointingmentioning

confidence: 99%

Fault tolerant adaptive parallel and distributed simulation through functional replication

D’Angelo

Ferretti

Marzolla

2019

Simulation Modelling Practice and Theory

View full text Add to dashboard Cite

show abstract

“…In a distributed system, reaching agreement is a fundamental problem because all nodes decide on a common outcome. The system requires that the nodes exchange information to negotiate with one another and eventually reach a common agreement before taking application-specific actions [30]. A blockchain is a distributed database system, wherein the nodes collectively decide whether to commit or abort a block in which they participate.…”

Section: Consensus Problem Statementmentioning

confidence: 99%

Scalable Dynamic Multi-Agent Practical Byzantine Fault-Tolerant Consensus in Permissioned Blockchain

et al. 2018

View full text Add to dashboard Cite

The permissioned blockchain system has recently become popular in a wide range of scenarios, such as artificial intelligence, financial applications and the Internet of things, due to its dominance in terms of distribution, decentralization, reliability and security. However, the Practical Byzantine Fault-Tolerant (PBFT) algorithm, which is currently adopted in such systems, sparks communication bottlenecks when the number of consensus nodes increases sharply, which seriously hinders large-scale applications. In this paper, we propose a scalable dynamic multi-agent hierarchical PBFT algorithm (SDMA-PBFT), which reduces the communication costs from O(n2) to O( n × k × log k n ). Specifically, SDMA-PBFT forms multiple autonomous systems at each agent node in which message multicasting can be efficiently carried out and the internal voting results can be effectively collected. Therefore, the design of these agent nodes facilitates the in-and-out operations of consensus nodes in the blockchain system. Simulation results show that our proposed algorithm substantially outperforms the PBFT algorithm in terms of latency. Hence, it can be applied to the permissioned blockchain system effectively and efficiently.

show abstract

Transparent three-phase Byzantine fault tolerance for parallel and distributed simulations

Cited by 2 publications

References 38 publications

Fault tolerant adaptive parallel and distributed simulation through functional replication

Fault tolerant adaptive parallel and distributed simulation through functional replication

Scalable Dynamic Multi-Agent Practical Byzantine Fault-Tolerant Consensus in Permissioned Blockchain

Contact Info

Product

Resources

About