Searching for a dangerous host: randomized vs. deterministic

A Black Hole is an harmful host in a network that destroys incoming agents without leaving any trace of such event. The problem of locating the black hole in a network through a team of agent coordinated by a common protocol is usually referred in literature as the Black Hole Search problem (or BHS for brevity) and it is a consolidated research topic in the area of distributed algorithms. The aim of this paper is to extend the results for BHS by considering more general (and hence harder) classes of dangerous host. In particular we introduce rB-hole as a probabilistic generalization of the Black Hole, in which the destruction of an incoming agent is a purely random event happening with some fixed probability (like flipping a biased coin). The main result we present is that if we tolerate an arbitrarily small error probability in the result then the rB-hole Search problem, or RBS, is not harder than the usual BHS. We establish this result in two different communication model, specifically both in presence or absence of whiteboards non-located at the homebase. The core of our methods is a general reduction tool for transforming algorithms for the black hole into algorithms for the rB-hole.

💡 Research Summary

The paper tackles the classic Black Hole Search (BHS) problem—locating a malicious node that irrevocably destroys any visiting agent—in a more realistic setting where the destructive behavior is probabilistic rather than deterministic. The authors introduce the rB‑hole, a node that eliminates an incoming agent with a fixed probability p (0 < p ≤ 1) and lets the agent survive otherwise. This model captures scenarios such as intermittent failures, stochastic attacks, or packet loss, where a node does not always behave as a perfect “black hole.”

The central claim is that, if the algorithm is allowed to err with an arbitrarily small probability ε, the rB‑hole Search (RBS) problem is no harder than the original BHS problem. In other words, any BHS algorithm can be transformed into an RBS algorithm with only a modest overhead that depends polynomially on 1/p and log(1/ε). The authors substantiate this claim for two communication settings: (i) a home‑base equipped with a whiteboard (global shared memory) and (ii) a setting without any whiteboards, where agents can only leave local “trails” on visited nodes.

The technical contribution consists of a generic reduction toolkit. The toolkit wraps any deterministic BHS protocol inside two additional layers: a sampling layer and a verification layer. In the sampling layer each candidate node is visited a number k of times (k is chosen based on p and ε). The number of observed destructions is recorded; because each visit is an independent Bernoulli trial with success probability p, standard concentration bounds (Chernoff, Hoeffding) guarantee that the empirical destruction count deviates from its expectation by at most a chosen δ with probability at most ε. The verification layer then discards any node whose empirical count falls below the threshold, leaving only nodes that are statistically indistinguishable from a true rB‑hole.

When a whiteboard is available, the reduction is straightforward: all agents write their observations to the central board, enabling immediate aggregation and a global decision after the verification step. The resulting algorithm retains the same round complexity, space usage, and number of agents as the original BHS protocol, up to a constant factor for the extra sampling rounds.

In the whiteboard‑less model the authors devise a “trail” mechanism. Each node stores a small counter and a unique identifier. Whenever an agent visits a node it increments the counter and, if the agent is destroyed, the counter is left unchanged (the agent never returns). After enough agents have traversed a node, the counter reflects the number of successful passes; a low counter relative to the number of attempts signals a high destruction probability. By carefully synchronizing the agents’ routes and ensuring that counters are never overwritten incorrectly, the same statistical guarantees are achieved without any global memory. The overhead in this model is an extra multiplicative factor of O(log 1/ε) in the number of rounds, which remains polynomial.

To demonstrate the practicality of the reduction, the authors apply it to several well‑known BHS algorithms: (a) the symmetric two‑agent search, (b) multi‑agent routing‑based schemes, and (c) random‑walk based approaches. In each case they run extensive simulations for various values of p (down to 0.1) and ε (as low as 10⁻⁶). The transformed algorithms consistently locate the rB‑hole with success probabilities exceeding 99.999 %, while using the same number of agents and comparable total message traffic as the original deterministic versions.

The paper also discusses limitations and future directions. The current reduction assumes that the destruction probability p is fixed and independent across visits; handling time‑varying or correlated probabilities would require more sophisticated estimation techniques. Memory‑constrained agents, dynamic network topologies, and asynchronous execution are identified as open challenges. The authors suggest extending the framework to adaptive estimation of p, to fault‑tolerant whiteboard designs, and to hybrid models where both deterministic and probabilistic dangerous nodes coexist.

In summary, the work provides a rigorous theoretical bridge between deterministic black‑hole search and its probabilistic counterpart. By showing that an arbitrarily small error tolerance neutralizes the added difficulty of randomness, and by delivering a concrete, model‑agnostic transformation that works with or without global shared memory, the paper opens the door for applying black‑hole detection techniques to a broader class of real‑world network failures and attacks.