Author | Conference | Journal | Organization | Year | DOI
Look for results that meet for the following criteria:
Academic
Publications
Periodic Data Retrieval Problem in Rings Containing a Malicious Host

Periodic Data Retrieval Problem in Rings Containing a Malicious Host,10.1007/978-3-642-13284-1_13,Rastislav Královic,Stanislav Miklík

Edit
Periodic Data Retrieval Problem in Rings Containing a Malicious Host   (Citations: 4)
BibTex | RIS | RefWorks Download
In the problems of exploration of faulty graphs, a team of cooperating agents is considered moving in a network containing one or more nodes that can harm the agents. A most notable among these problems is the problem of black hole location, where the network contains one node that destroys any incoming agent, and the task of the agents is to determine the location of this node. The main complexity measure is the number of agents needed to solve the problem. In this paper we begin with a study of malicious hosts with more varied behavior. We study the problem of periodic data retrieval which is equivalent to periodic exploration in fault-free networks, and to black hole location in networks with one black hole. The main result of the paper states that, in case of rings, it is sufficient to protect the internal state of the agent (i.e. the malicious host cannot change or create the content of agent’s memory), and the periodic data retrieval problem is solvable by a constant number of agents.
Conference: Colloquium on Structural Information & Communication Complexity - SIROCCO , pp. 157-167, 2010
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
More »
Sort by:

Citations (4)

Share this on