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

实用匿名动态网络的计数是多项式的

Counting in Practical Anonymous Dynamic Networks is Polynomial

Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro

摘要:

匿名动态网络是一个苛刻的计算环境,由于不断变化的拓扑结构和缺乏标识符。计算网络的大小,一个被称为计数的问题,是特别具有挑战性的,因为接收到的消息不能被标记为特定的发送者。以前的工作在匿名动态网络计数没有提供足够的保证,在实践中使用。事实上,它们要么只计算网络大小的上限,可能是指数级的,要么只保证双指数运行时间,要么不终止,要么只保证最终终止而不保证运行时间。更快的实验方案不能保证正确的计数。最近,我们提出了第一个计数协议,该协议计算具有指数运行时间保证的精确计数。该协议需要一个领导节点的存在和知识的任何上界三角洲的最大数量的邻居,任何节点将永远有。在目前的工作中,我们补充了后者的理论研究,评估这种协议在实践中的性能。我们测试了实际中可能出现的各种网络拓扑,包括极端情况,如树、路径和不断变化的拓扑。我们还测试了暂时未连接的网络。我们的模拟表明,该协议对于所有测试的输入都是多项式的,这为在拓扑变化可预测的实际应用中使用它铺平了道路。模拟还提供了关于拓扑变化对信息传播的影响的见解。据我们所知,这是第一个实验研究,显示了在多项式时间内计算精确计数的可能性,在各种匿名动态网络中,比预期的更糟糕。

英文摘要:

Anonymous Dynamic Networks is a harsh computational environment due to changing topology and lack of identifiers. Computing the size of the network, a problem known as Counting, is particularly challenging because messages received cannot be tagged to a specific sender. Previous works on Counting in Anonymous Dynamic Networks do not provide enough guarantees to be used in practice. Indeed, they either compute only an upper bound on the network size that may be as bad as exponential, or guarantee only double-exponential running time, or do not terminate, or guarantee only eventual termination without running-time guarantees. Faster experimental protocols do not guarantee the correct count. Recently, we presented the first Counting protocol that computes the exact count with exponential running-time guarantees. The protocol requires the presence of one leader node and knowledge of any upper bound Delta on the maximum number of neighbors that any node will ever have. In the present work, we complement the latter theoretical study evaluating the performance of such protocol in practice. We tested a variety of network topologies that may appear in practice, including extremal cases such as trees, paths, and continuously changing topologies. We also tested networks that temporarily are not connected. Our simulations showed that the protocol is polynomial for all the inputs tested, paving the way to use it in practical applications where topology changes are predictable. The simulations also provided insight on the impact of topology changes on information dissemination. To the best of our knowledge, this is the first experimental study that shows the possibility of computing the exact count in polynomial time in a variety of Anonymous Dynamic Networks that are worse than expected in practice.

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

↑