Faulty node repair and dynamically spawned black hole search

New threats to networks are constantly arising. This justifies protecting network assets and mitigating the risk associated with attacks. In a distributed environment, researchers aim, in particular, at eliminating faulty network entities. More specifically, much research has been conducted on locating a single static black hole, which is defined as a network site whose existence is known a priori and that disposes of any incoming data without leaving any trace of this occurrence. However, the prevalence of faulty nodes requires an algorithm able to (a) identify faulty nodes that can be repaired without human intervention and (b) locate black holes, which are taken to be faulty nodes whose repair does require human intervention. In this paper, we consider a specific attack model that involves multiple faulty nodes that can be repaired by mobile software agents, as well as a virus v that can infect a previously repaired faulty node and turn it into a black hole. We refer to the task of repairing multiple faulty nodes and pointing out the location of the black hole as the Faulty Node Repair and Dynamically Spawned Black Hole Search. Wefirst analyze the attack model we put forth. We then explain (a) how to identify whether a node is either (1) a normal node or (2) a repairable faulty node or (3) the black hole that has been infected by virus v during the search/repair process and, (b) how to perform the correct relevant actions. These two steps constitute a complex task, which, we explain, significantly differs from the traditional Black Hole Search. We continue by proposing an algorithm to solve this problem in an

Repairing faulty nodes and locating a dynamically spawned black hole search using tokens

In a distributed cloud, it is crucial to detect and eliminate faulty network entities in order to protect network assets and mitigate the risks associated with constantly arising attacks. Much research has been conducted on locating a single static black hole, which is defined as a network site whose existence is known a priori and that disposes of any incoming data without leaving any trace of this occurrence. In this paper, we introduce a specific attack model that involves multiple faulty nodes that can be repaired by mobile software agents, as well as what we call a gray virus that can infect a previously repaired faulty node and turn it into a black hole. The Faulty Node Repair and Dynamically Spawned Black Hole Search (FNR-DSBHS) problem that proceeds from this model is much more complex and realistic than the traditional Black Hole Search problem. We first explain why existing algorithms addressing the latter do not work under this new attack model. We then distinguish between a one-stop gray virus that, after infecting a faulty node that has been repaired, can no longer travel to other nodes; and a multi-stop gray virus. We observe that, in an asynchronous network, a solution to the FNR-DSBHS problem is possible only when dealing with a single one-stop gray virus. In that specific context, we present a solution for an asynchronous ring network using a token model, that is, a ring in which a constant number of tokens is the only means of communication between the team of agents. We claim that, in such a ring, b + 9 agents can repair all faulty nodes as well as locate the black hole that is infected by this single one-stop gray virus. We prove the correctness of the proposed solution and analyze its complexity in terms of number of mobile agents used and total number of moves performed by these agents. We show that in the worst case, within O(kn2) moves, b + 9 agents suffice to repair b faulty nodes and report the location of the black hole that is infected, at any arbitrary point in time, by the one-stop gray virus