On Byzantine Containment Properties of the min + 1 Protocol

Dubois, Swan; Masuzawa, Toru; Tixeuil, S.

doi:10.1007/978-3-642-16023-3_10

Cited by 18 publications

(21 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is useful for problems where information from remote nodes is unimportant (such as vertex coloring, link coloring, or dining philosophers). Timelocal algorithms [12], [13], [14], [15], [23] try to limit over time the effect of Byzantine faults. Time-local algorithms presented so far can tolerate the presence of at most a single Byzantine node, and are unable to mask the effect of Byzantine actions.…”

Section: Related Workmentioning

confidence: 99%

Communicating Reliably in Multihop Dynamic Networks Despite Byzantine Failures

Maurer

Tixeuil²,

Défago

2015

2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS)

View full text Add to dashboard Cite

We consider the following problem: two nodes want to reliably communicate in a dynamic multihop network where some nodes have been compromised, and may have a totally arbitrary and unpredictable behavior. These nodes are called Byzantine. We consider the two cases where cryptography is available and not available.We prove the necessary and sufficient condition (that is, the weakest possible condition) to ensure reliable communication in this context. Our proof is constructive, as we provide Byzantineresilient algorithms for reliable communication that are optimal with respect to our impossibility results.In a second part, we investigate the impact of our conditions in three case studies: participants interacting in a conference, robots moving on a grid and agents in the subway. Our simulations indicate a clear benefit of using our algorithms for reliable communication in those contexts.

show abstract

Section: Related Workmentioning

confidence: 99%

Communicating Reliably in Multihop Dynamic Networks Despite Byzantine Failures

Maurer

Tixeuil²,

Défago

2015

2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS)

View full text Add to dashboard Cite

show abstract

“…A notable class of algorithms tolerates Byzantine failures with either space [17], [22], [25] or time [6], [7], [8], [9], [16] locality. Space local algorithms try to contain the fault as close to its source as possible.…”

Section: Related Workmentioning

confidence: 99%

Containing Byzantine Failures with Control Zones

Maurer

Tixeuil

2015

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

We consider the problem of reliably broadcasting messages in a network where some nodes are likely to fail. We consider the most general failure model: the Byzantine model, where the failing nodes have an arbitrary behavior, and may actively try to destabilize the network. We focus on totally decentralized solutions. Most existing solutions require high network connectivity, and are not adapted to sparsely connected networks. A typical example is the grid, where each node has at most four neighbors. In this paper, we propose a new broadcast protocol adapted to such networks. This protocol is based on interconnected subsets called control zones, that filter the diffusion of false messages. We give a methodology to determine a set of nodes that always communicate reliably, depending on the placement of Byzantine nodes. We then use this methodology to perform an experimental evaluation on square and hexagonal grids, in the presence of randomly distributed Byzantine failures. We show that our protocol significantly improves the communication probability, compared to existing solutions.

show abstract

“…Now, if we focus on topology-aware strong stabilization, [6] introduced the following containment area: [11] is a (t, S * B , n − 1)-TA strongly stabilizing protocol for maximum metric spanning tree construction with respect to BFS where t is a finite integer.…”

Section: Theorem 5 ([6])mentioning

confidence: 99%

“…First, we generalize the set S * B previously defined for the BFS metric in [6] to any maximizable metric M = (M, W, mr, met, ≺).…”

Section: Topology Aware Strong Stabilizationmentioning

confidence: 99%

Maximum Metric Spanning Tree Made Byzantine Tolerant

2014

Self Cite

View full text Add to dashboard Cite

Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. This paper focus on systems that are both self-stabilizing and Byzantine tolerant.We consider the well known problem of constructing a maximum metric tree in this context. Combining these two properties is known to induce many impossibility results. In this paper, we provide first two impossibility results about the construction of maximum metric tree in presence of transients and (permanent) Byzantine faults. Then, we provide a new self-stabilizing protocol that provides optimal containment of an arbitrary number of Byzantine faults.

show abstract

On Byzantine Containment Properties of the min + 1 Protocol

Cited by 18 publications

References 16 publications

Communicating Reliably in Multihop Dynamic Networks Despite Byzantine Failures

Communicating Reliably in Multihop Dynamic Networks Despite Byzantine Failures

Containing Byzantine Failures with Control Zones

Maximum Metric Spanning Tree Made Byzantine Tolerant

Contact Info

Product

Resources

About