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

MIS随时随地

MIS on the fly

Yehuda Afek, Noga Alon, Ziv Bar-Joseph

摘要:

人类非常善于为特定问题优化解决方案。另一方面,生物过程已经进化到可以处理多个受约束的分布式环境,因此它们是鲁棒的和适应性强的。受生物系统中观察结果的启发,我们最近提出了一个简单的新的随机分布式MIS算法\cite{ZScience}。在这里,我们通过删除我们所做的一些强假设来扩展这些结果,使算法更实用。具体来说,我们提出了一个$O(\log^2 n)$轮同步随机MIS算法,它只使用1位一元消息(碰撞检测的蜂鸣信号),允许异步唤醒,不承担任何知识的网络拓扑结构,并假设只有一个松散的网络大小的限制。我们还提出了一个扩展,没有碰撞检测,轮的复杂性增加到$(\log^3 n)$。最后,我们证明了我们的算法是最优的一些限制下,通过提出一个严格的下限的$Ω(\log^2 n)$的轮数需要构建一个MIS的限制模型。

英文摘要:

Humans are very good at optimizing solutions for specific problems. Biological processes, on the other hand, have evolved to handle multiple constrained distributed environments and so they are robust and adaptable. Inspired by observations made in a biological system we have recently presented a simple new randomized distributed MIS algorithm \cite{ZScience}. Here we extend these results by removing a number of strong assumptions that we made, making the algorithms more practical. Specifically we present an $O(\log^2 n)$ rounds synchronous randomized MIS algorithm which uses only 1 bit unary messages (a beeping signal with collision detection), allows for asynchronous wake up, does not assume any knowledge of the network topology, and assumes only a loose bound on the network size. We also present an extension with no collision detection in which the round complexity increases to $(\log^3 n)$. Finally, we show that our algorithm is optimal under some restriction, by presenting a tight lower bound of $Ω(\log^2 n)$ on the number of rounds required to construct a MIS for a restricted model.

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

↑