网络中存在时延故障时的恢复
Rendezvous in Networks in Spite of Delay Faults
摘要:
两个移动代理,从一个未知的网络的不同节点开始,必须在同一个节点。代理使用确定性算法在同步轮中移动。每个代理都有一个不同的标签,它可以在算法的执行中使用,但它不知道其他代理的标签。代理不知道网络大小的任何界限。在每一轮中,代理决定它是否保持空闲,或者它是否想要移动到相邻节点之一。代理会受到延迟故障的影响:如果代理在给定的一轮中发生故障,它将保留在当前节点中,而不管它的决定如何。如果它计划移动并且发生了故障,那么智能体知道它。我们考虑三种故障分布情况:随机(独立地在每一轮中并且对于具有恒定概率0 < p < 1的每种试剂),无界对抗(对手可以延迟代理任意有限数量的连续回合)和有界对抗(对手可以延迟代理至多c个连续回合,其中c对于代理是未知的)。交会算法的质量度量是其成本,即边缘遍历的总数。对于随机故障,我们提出了一种算法,其代价多项式在网络的大小为n,在较大的标签L中为多对数,该算法在任意网络中以非常高的概率实现会合。相比之下,无界对抗故障,我们表明,会合是不可行的,即使在类环。在这种情况下,我们给出了一个成本为O(nl)的会合算法,其中l是较小的标签,工作在任意树中,我们证明了Ω(l)是会合成本的下界,即使是两个节点的树。对于有界对抗性故障,我们给出了一个适用于任意网络的会合算法,其代价多项式为n,在界c和较大标号L中为对数。
英文摘要:
Two mobile agents, starting from different nodes of an unknown network, have to meet at the same node. Agents move in synchronous rounds using a deterministic algorithm. Each agent has a different label, which it can use in the execution of the algorithm, but it does not know the label of the other agent. Agents do not know any bound on the size of the network. In each round an agent decides if it remains idle or if it wants to move to one of the adjacent nodes. Agents are subject to delay faults: if an agent incurs a fault in a given round, it remains in the current node, regardless of its decision. If it planned to move and the fault happened, the agent is aware of it. We consider three scenarios of fault distribution: random (independently in each round and for each agent with constant probability 0 < p < 1), unbounded adver- sarial (the adversary can delay an agent for an arbitrary finite number of consecutive rounds) and bounded adversarial (the adversary can delay an agent for at most c consecutive rounds, where c is unknown to the agents). The quality measure of a rendezvous algorithm is its cost, which is the total number of edge traversals. For random faults, we show an algorithm with cost polynomial in the size n of the network and polylogarithmic in the larger label L, which achieves rendezvous with very high probability in arbitrary networks. By contrast, for unbounded adversarial faults we show that rendezvous is not feasible, even in the class of rings. Under this scenario we give a rendezvous algorithm with cost O(nl), where l is the smaller label, working in arbitrary trees, and we show that Ω(l) is the lower bound on rendezvous cost, even for the two-node tree. For bounded adversarial faults, we give a rendezvous algorithm working for arbitrary networks, with cost polynomial in n, and logarithmic in the bound c and in the larger label L.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。