arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1106.6037cs.DS
收藏

用散布在同步环上的有限自动机搜索黑洞

Black Hole Search with Finite Automata Scattered in a Synchronous Torus

Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou

摘要:

我们考虑的问题,定位一个黑洞在同步匿名网络中使用有限状态代理。黑洞是网络中的一个有害节点,它会摧毁任何访问该节点的代理,而不会留下任何痕迹。目标是在不破坏太多代理的情况下定位黑洞。当代理最初分散在网络中并且不知道彼此的位置时,这是难以实现的。以前对黑洞搜索的研究使用了更强大的模型,其中代理具有非恒定记忆,标记有不同的标识符,可以在网络的节点上写入消息或标记网络的边缘。相比之下,我们使用一小组有限状态代理来解决这个问题,每个代理都携带恒定数量的相同令牌,这些令牌可以放置在网络的节点上。因此,在我们的算法中使用的所有资源是独立的网络大小。我们限制我们的注意力面向环面网络,并首先表明,没有有限的团队有限状态代理可以解决这个问题,在这样的网络中,令牌是不可移动的。在代理配备可移动令牌的情况下,我们确定的代理和令牌的数量上的下限所需的解决问题的环面网络的任意大小。此外,我们提出了一个确定性的解决方案,黑洞搜索问题的面向环面网络,使用最少数量的代理和令牌。

英文摘要:

We consider the problem of locating a black hole in synchronous anonymous networks using finite state agents. A black hole is a harmful node in the network that destroys any agent visiting that node without leaving any trace. The objective is to locate the black hole without destroying too many agents. This is difficult to achieve when the agents are initially scattered in the network and are unaware of the location of each other. Previous studies for black hole search used more powerful models where the agents had non-constant memory, were labelled with distinct identifiers and could either write messages on the nodes of the network or mark the edges of the network. In contrast, we solve the problem using a small team of finite-state agents each carrying a constant number of identical tokens that could be placed on the nodes of the network. Thus, all resources used in our algorithms are independent of the network size. We restrict our attention to oriented torus networks and first show that no finite team of finite state agents can solve the problem in such networks, when the tokens are not movable. In case the agents are equipped with movable tokens, we determine lower bounds on the number of agents and tokens required for solving the problem in torus networks of arbitrary size. Further, we present a deterministic solution to the black hole search problem for oriented torus networks, using the minimum number of agents and tokens.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑