arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1504.06963cs.DScs.DCmath.PR
收藏

Herman协议猜想的广义解

Generalized solution for the Herman Protocol Conjecture

Endre Csóka, Szabolcs Mészáros, András Pongrácz

摘要:

Herman协议猜想指出,在由$N$个相同进程组成的系统中,Herman自稳定算法的期望时间$\mathbb{E}(\mathbf{T})$至多为$\frac{4}{27}N^{2}$。我们证明了猜想在其标准的无偏的,也在一个有偏的形式,离散过程,并扩展结果进一步的变种,令牌移动通过某些Lévy过程。此外,我们推导出一个边界上的期望值的$\mathbb{E}(α^{\mathbf{T}})$的所有$1\leq α\leq (1-\varepsilon)^{-1}$与特定的$\varepsilon>0$。根据经验证明的优化结果的正确性,所有这些估计在初始状态上达到最大值,其中三个令牌等距分布在$N$过程的环上。这种关系是$\mathbb{E}(\mathbf{T})$和$\mathbb{E}(α^{\mathbf{T}})$都是概率$\mathbb{P}(\mathbf{T}\geq t)$的加权和这一事实的征兆。

英文摘要:

The Herman Protocol Conjecture states that the expected time $\mathbb{E}(\mathbf{T})$ of Herman's self-stabilizing algorithm in a system consisting of $N$ identical processes organized in a ring holding several tokens is at most $\frac{4}{27}N^{2}$. We prove the conjecture in its standard unbiased and also in a biased form for discrete processes, and extend the result to further variants where the tokens move via certain Lévy processes. Moreover, we derive a bound on the expected value of $\mathbb{E}(α^{\mathbf{T}})$ for all $1\leq α\leq (1-\varepsilon)^{-1}$ with a specific $\varepsilon>0$. Subject to the correctness of an optimization result that can be demonstrated empirically, all these estimations attain their maximum on the initial state with three tokens distributed equidistantly on the ring of $N$ processes. Such a relation is the symptom of the fact that both $\mathbb{E}(\mathbf{T})$ and $\mathbb{E}(α^{\mathbf{T}})$ are weighted sums of the probabilities $\mathbb{P}(\mathbf{T}\geq t)$.

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

↑