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

通用自适应自稳定遍历方案:随机游走和重载波

Universal adaptive self-stabilizing traversal scheme: random walk and reloading wave

Thibault Bernard, Alain Bui, Devan Sohier

摘要:

在本文中,我们研究了随机游走的令牌循环在动态环境中的失败。我们描述了假设的动态环境,允许随机游走,以满足令牌访问任何节点无限频繁的重要属性。该方案的随机性允许它在任何拓扑上工作,并且在拓扑变化后不需要自适应,这对于应用于动态系统是理想的属性。为了使随机游走成为遍历方案并回答并发问题,需要保证恰好有一个令牌在系统中循环。在存在瞬时故障的情况下,可能会出现具有多个令牌或没有令牌的配置。随机游走的相遇性质解决了多个令牌的情况。我们提出的重新加载波机制,加上超时,允许检测和解决没有令牌的情况。这种遍历方案是自稳定的,并且是通用的,这意味着它不需要对系统拓扑结构进行假设。我们描述的条件下,该算法是容忍动态重新配置的动态性(与本地检测标准)。最后,我们通过研究令牌到节点的两次访问之间的时间来得出结论,我们使用该时间来根据一些系统特性来调整重载波机制的参数。

英文摘要:

In this paper, we investigate random walk based token circulation in dynamic environments subject to failures. We describe hypotheses on the dynamic environment that allow random walks to meet the important property that the token visits any node infinitely often. The randomness of this scheme allows it to work on any topology, and require no adaptation after a topological change, which is a desirable property for applications to dynamic systems. For random walks to be a traversal scheme and to answer the concurrence problem, one needs to guarantee that exactly one token circulates in the system. In the presence of transient failures, configurations with multiple tokens or with no token can occur. The meeting property of random walks solves the cases with multiple tokens. The reloading wave mechanism we propose, together with timeouts, allows to detect and solve cases with no token. This traversal scheme is self-stabilizing, and universal, meaning that it needs no assumption on the system topology. We describe conditions on the dynamicity (with a local detection criterion) under which the algorithm is tolerant to dynamic reconfigurations. We conclude by a study on the time between two visits of the token to a node, which we use to tune the parameters of the reloading wave mechanism according to some system characteristics.

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

↑