arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0412007cs.NIcond-mat.other
收藏

用类跟踪路由探测器探索网络:理论与仿真

Exploring networks with traceroute-like probes: theory and simulations

Luca Dall'Asta, Ignacio Alvarez-Hamelin, Alain Barrat, Alexei Vazquez, Alessandro Vespignani

摘要:

映射互联网通常包括通过使用类似跟踪路由的探测器从有限的源集合中对网络进行采样。这种方法类似于将不同的生成树合并到一组目的地,被认为会引入不受控制的采样偏差,这可能会产生与原始图截然不同的采样图的统计特性。在本文中,我们探讨了这些偏见,并提供了一个统计分析其起源。我们推导出边缘和顶点检测的概率的解析近似值,该概率利用了源和目标的数量的作用,并使我们能够将底层网络的全局拓扑性质与采样图的统计精度相关联。特别是,我们发现边缘和顶点检测概率取决于每个元素的介数中心性。这使我们能够表明,最短路径路由采样提供了一个更好的表征基础图形的广泛分布的连接。我们补充分析讨论与整个数值模拟映射策略的网络模型与不同的拓扑结构的调查。我们发现,抽样图提供了一个公平的定性表征的统计特性的原始网络在一个公平的范围内不同的策略和探索参数。此外,我们的特征的冗余度和完整性的探索过程的网络的拓扑性质的函数。最后,我们数值研究如何在采样图中发现的顶点和边的分数取决于特定的部署的探测源。这些结果可能会提示更有效的映射策略的步骤。

英文摘要:

Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different spanning trees to a set of destination, has been argued to introduce uncontrolled sampling biases that might produce statistical properties of the sampled graph which sharply differ from the original ones. In this paper we explore these biases and provide a statistical analysis of their origin. We derive an analytical approximation for the probability of edge and vertex detection that exploits the role of the number of sources and targets and allows us to relate the global topological properties of the underlying network with the statistical accuracy of the sampled graph. In particular, we find that the edge and vertex detection probability depends on the betweenness centrality of each element. This allows us to show that shortest path routed sampling provides a better characterization of underlying graphs with broad distributions of connectivity. We complement the analytical discussion with a throughout numerical investigation of simulated mapping strategies in network models with different topologies. We show that sampled graphs provide a fair qualitative characterization of the statistical properties of the original networks in a fair range of different strategies and exploration parameters. Moreover, we characterize the level of redundancy and completeness of the exploration process as a function of the topological properties of the network. Finally, we study numerically how the fraction of vertices and edges discovered in the sampled graph depends on the particular deployements of probing sources. The results might hint the steps toward more efficient mapping strategies.

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

↑