Sciweavers

Share
SIROCCO
2004

Improved Bounds for Optimal Black Hole Search with a Network Map

8 years 11 months ago
Improved Bounds for Optimal Black Hole Search with a Network Map
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine the location of the black hole. A team of agents, provided with a network map and executing the same protocol, solves the problem if at least one agent survives and, within finite time, knows the location of the black hole. It is known that a team must have at least two agents. Interestingly, two agents with a map of the network can locate the black hole with O(n) moves in many highly regular networks; however the protocols used apply only to a narrow class of networks. On the other hand, any universal solution protocol must use (n log n) moves in the worst case, regardless of the size of the team. A universal solution protocol has been recently presented that uses a team of just two agents with a map of the network, and locates a black hole in at most O(n log n) moves. Thus, this protocol has both optimal s...
Stefan Dobrev, Paola Flocchini, Nicola Santoro
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2004
Where SIROCCO
Authors Stefan Dobrev, Paola Flocchini, Nicola Santoro
Comments (0)
books