任意网络上的代数流言
Algebraic gossip on Arbitrary Networks
摘要：
考虑一个节点网络，其中每个节点都有一条消息要与所有其他节点通信。对于这个通信问题，我们分析了一个基于八卦的协议，编码的消息进行交换。Aoyama和Shah研究了这个问题，其中提供了基于底层通信图的频谱特性的传播时间的约束。我们的贡献是一个统一的界限，适用于任意网络。
英文摘要：
Consider a network of nodes where each node has a message to communicate to all other nodes. For this communication problem, we analyze a gossip based protocol where coded messages are exchanged. This problem was studied by Aoyama and Shah where a bound to the dissemination time based on the spectral properties of the underlying communication graph is provided. Our contribution is a uniform bound that holds for arbitrary networks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
