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

唱式MIS模型

Singing a MIS

Department of Computer Science, University of California, Irvine(加州大学尔湾分校计算机科学系);BitRipple Inc.(BitRipple公司)

Sandy Irani, Michael Luby

AI总结:

该研究提出了一种在动态网络中以对数时间收敛到MIS的唱式模型,通过代理竞争机制实现高效分布式计算。

摘要:

我们介绍了一个称为唱式模型的广播模型,其中代理对通信网络的大小和结构以及其直接邻居毫不知情。代理可以唱多个音符,这些音符会被邻居听到。该模型是蜂鸣模型的推广,其中代理只能在单一频率上发出声音。我们提供了一个简单自然的协议,其中代理与邻居竞争,其强度体现在他们所唱的音符数量上。该协议以高概率在$O(log(n))$时间内收敛,其中$n$是网络中代理的数量。该协议在异步模型中工作,其中轮次长度不同且起始时间不同。它适用于完全动态网络,其中代理可能有故障。该协议是首个在网络无感知模型中以对数时间收敛到MIS的动态网络协议。

英文摘要:

We introduce a broadcast model called the singing model, where agents are oblivious of the size and structure of the communication network, even their immediate neighborhood. Agents can sing multiple notes which are heard by their neighbors. The model is a generalization of the beeping model, where agents can only emit sound at a single frequency. We give a simple and natural protocol where agents compete with their neighbors and their strength is reflected in the number of notes they sing. It converges in $O(log(n))$ time with high probability, where $n$ is the number of agents in the network. The protocol works in an asynchronous model where rounds vary in length and have different start times. It works with completely dynamic networks where agents can be faulty. The protocol is the first to converge to an MIS in logarithmic time for dynamic networks in a network oblivious model.

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

↑