论文标题
简单而快速的分布式中心性计算
Simple and Fast Distributed Computation of Betweenness Centrality
论文作者
论文摘要
中心中心性是已成功应用于网络分析的图表参数。在计算机网络的背景下，考虑到各种目标，从路由到服务放置。但是，如Maccari等人所观察到的。 [Infocom 2018]，缺乏用于计算此参数的可用，完全分布的算法的研究，从而阻碍了改善协议中心的研究。我们通过设计一种用于计算中间性中间性的有效算法来解决此问题，可以通过最小化基于Bellman-Ford的任何距离矢量路由协议来实现。我们实施的收敛时间与网络直径成正比
Betweenness centrality is a graph parameter that has been successfully applied to network analysis. In the context of computer networks, it was considered for various objectives, ranging from routing to service placement. However, as observed by Maccari et al. [INFOCOM 2018], research on betweenness centrality for improving protocols was hampered by the lack of a usable, fully distributed algorithm for computing this parameter. We resolve this issue by designing an efficient algorithm for computing betweenness centrality, which can be implemented by minimal modifications to any distance-vector routing protocol based on Bellman-Ford. The convergence time of our implementation is shown to be proportional to the diameter of the network
