Discovering Network Topology in the Presence of Byzantine Faults

Abstract

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.

Communicating Reliably in Multihop Dynamic Networks Despite Byzantine Failures

“…Most related to our work is the line of research that assume the existence of 2k + 1 node-disjoint paths from source to destination, in order to provide reliable communication in the presence of up to k Byzantine failure [9], [31], [10]. The initial solution [9] assumes that each node is aware of the global network topology, but this hypothesis was dropped in subsequent work [31], [19].…”

“…The initial solution [9] assumes that each node is aware of the global network topology, but this hypothesis was dropped in subsequent work [31], [19].…”

“…The proof technique used in [9], [31], [10] implicitly relies on Menger's theorem [5], which can be expressed as follows: there exists x disjoint paths between two nodes p and q if and only if x nodes must be removed to disconnect p and q.…”

“…We make the same hypotheses as previous work on the subject [4], [9], [17], [25], [26], [27], [31], [32]. First, each node has a unique identifier.…”

Performance study of Byzantine Agreement Protocol with artificial neural network

“…Since 1982 [21], various BAPs have been proposed based on different assumptions [20,28,37] that include considerations of network topology [28,29,35,51], processor fault, link fault [39,40,48,49], node mobility [11,44,46,47] and faulty node detection [5,26,37,45,50]. The main purpose of these BAPs is to reduce the computational load by specializing in the generalized model of traditional BAP [21].…”