无限树中的确定性秩
Deterministic Rendezvous in Infinite Trees
摘要:
会合任务要求两个移动代理,从不同的节点的网络建模为一个图,以满足在同一个节点。代理具有不同的标签,这些标签是来自集合$\{1,\dots,L\}$的整数。它们可能在不同的时间醒来,并以同步的方式移动。在每一轮中,代理可以保持空闲或移动到相邻节点。我们考虑确定性会合算法。这种算法的时间是从较早的代理唤醒到会议的轮数。在本文中,我们考虑在无限树会合。我们的主要目标是研究树木的方位对交会时间的影响。我们首先设计了一个适用于无向正则树的会合算法,其时间为$O(z(D) \log L)$,其中$z(D)$是半径为$D$的球的大小,即距离给定节点至多$D$的节点数。该算法适用于任意延迟唤醒时间的代理,不需要任何初始信息的参数$L$或$D$。它的缺点是它的复杂性:对于树的任何度$d>2$,$z(D)$在$D$中是指数的。我们证明,这种高的复杂性是不可避免的:$Ω(z(D))$原来是一个下界的会合时间在无方向的正规树,即使同时开始,即使当代理知道$L$和$D$。然后我们把注意力转向定向树。而对于任意延迟的唤醒时间的代理之间的下限$Ω(z(D))$仍然成立,同时启动的时间会合可以显着缩短。我们表明,如果代理知道$L$的多项式上界或$D$的线性上界,那么会合可以在定向树的时间$O(D\log L)$,这是最优的。当没有这样的额外的知识是可用的,我们设计了一个算法工作在时间$O(D^2+\log ^2L)$。
英文摘要:
The rendezvous task calls for two mobile agents, starting from different nodes of a network modeled as a graph to meet at the same node. Agents have different labels which are integers from a set $\{1,\dots,L\}$. They wake up at possibly different times and move in synchronous rounds. In each round, an agent can either stay idle or move to an adjacent node. We consider deterministic rendezvous algorithms. The time of such an algorithm is the number of rounds since the wakeup of the earlier agent till the meeting. In this paper we consider rendezvous in infinite trees. Our main goal is to study the impact of orientation of a tree on the time of rendezvous. We first design a rendezvous algorithm working for unoriented regular trees, whose time is in $O(z(D) \log L)$, where $z(D)$ is the size of the ball of radius $D$, i.e, the number of nodes at distance at most $D$ from a given node. The algorithm works for arbitrary delay between waking times of agents and does not require any initial information about parameters $L$ or $D$. Its disadvantage is its complexity: $z(D)$ is exponential in $D$ for any degree $d>2$ of the tree. We prove that this high complexity is inevitable: $Ω(z(D))$ turns out to be a lower bound on rendezvous time in unoriented regular trees, even for simultaneous start and even when agents know $L$ and $D$. Then we turn attention to oriented trees. While for arbitrary delay between waking times of agents the lower bound $Ω(z(D))$ still holds, for simultaneous start the time of rendezvous can be dramatically shortened. We show that if agents know either a polynomial upper bound on $L$ or a linear upper bound on $D$, then rendezvous can be accomplished in oriented trees in time $O(D\log L)$, which is optimal. When no such extra knowledge is available, we design an algorithm working in time $O(D^2+\log ^2L)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。