Bounding the Impact of Unbounded Attacks in Stabilization

Masuzawa, Toru; Tixeuil, Sébastien

doi:10.1007/978-3-540-49823-0_31

Cited by 25 publications

(18 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

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

“…Pelc and Peleg [20] consider arbitrary topology but assume that each node knows the exact topology a priori. A notable class of algorithms tolerates Byzantine faults with either space [17], [19], [22] or time [16] locality. Yet, the emphasis of space local algorithms is on containing the fault as close to its source as possible.…”

Section: Related Workmentioning

confidence: 99%

Discovering Network Topology in the Presence of Byzantine Faults

Nesterenko

Tixeuil

2009

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem is an abstraction of fault-tolerant routing. We formally state the weak and strong versions of the problem. The weak version requires that either each node discovers the topology of the network or at least one node detects the presence of a faulty node. The strong version requires that each node discovers the topology regardless of faults. We focus on noncryptographic solutions to these problems. We explore their bounds. We prove that the weak topology discovery problem is solvable only if the connectivity of the network exceeds the number of faults in the system. Similarly, we show that the strong version of the problem is solvable only if the network connectivity is more than twice the number of faults. We present solutions to both versions of the problem. The presented algorithms match the established graph connectivity bounds. The algorithms do not require the individual nodes to know either the diameter or the size of the network. The message complexity of both programs is low polynomial with respect to the network size. We describe how our solutions can be extended to add the property of termination, handle topology changes, and perform neighborhood discovery.

show abstract

Bounding the Impact of Unbounded Attacks in Stabilization

Cited by 25 publications

References 11 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

Discovering Network Topology in the Presence of Byzantine Faults

Contact Info

Product

Resources

About