Evaluation of a new method for measuring the internet degree distribution: Simulation results

被引:2
作者
Crespelle, Christophe [1 ]
Tarissan, Fabien
机构
[1] CNRS, LIP6, F-75016 Paris, France
关键词
Internet topology; Degree distribution; Traceroute simulations; Neighborhood Flooding; TOPOLOGY; EXPLORATIONS; RELEVANCE;
D O I
10.1016/j.comcom.2010.06.006
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Many contributions rely on the degree distribution of the Internet topology. However, current knowledge of this property is based on biased and erroneous measurements and is subject to much debate. Recently, in [1], a new approach, referred to as the Neighborhood Flooding method, was proposed to avoid issues raised by classical measurements. It aims at measuring the neighborhood of Internet core routers by sending traceroute probes from many monitors distributed in the Internet towards a given target router. In this paper, we investigate the accuracy of this method with simulations. Our results show that Neighborhood Flooding is free from the bias highlighted in the classical approach and is able to observe properly the exact degree of a vast majority of nodes in the core of the network. We show how the quality of the estimation depends on the number of monitors used and we carefully examine the influence of parameters of the simulations on our results. We also point out some limitations of the Neighborhood Flooding method and discuss their impact on the observed distribution. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:635 / 648
页数:14
相关论文
共 17 条
[1]   On the Bias of Traceroute Sampling: or, Power-Law Degree Distributions in Regular Graphs [J].
Achlioptas, Dimitris ;
Clauset, Aaron ;
Kempe, David ;
Moore, Cristopher .
JOURNAL OF THE ACM, 2009, 56 (04)
[2]  
Aiello W., 2000, Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, P171, DOI 10.1145/335305.335326
[3]  
Barford P, 2001, IMW 2001: PROCEEDINGS OF THE FIRST ACM SIGCOMM INTERNET MEASUREMENT WORKSHOP, P5
[4]   A faster algorithm for betweenness centrality [J].
Brandes, U .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 2001, 25 (02) :163-177
[5]  
*CAIDA, 2010, MACR TOP MEAS PROJ
[6]  
Cormen T., 2001, Introduction to Algorithms
[7]  
CRESPELLE C, 2 IEEE INT IN PRESS
[8]   Exploring networks with traceroute-like probes:: Theory and simulations [J].
Dall'Asta, L ;
Alvarez-Hamelin, I ;
Barrata, A ;
Vázquez, A ;
Vespignani, A .
THEORETICAL COMPUTER SCIENCE, 2006, 355 (01) :6-24
[9]  
ERDOS P, 1960, MAGYAR TUD AKAD MAT, V5, P1761
[10]  
Faloutsos M, 1999, COMP COMM R, V29, P251, DOI 10.1145/316194.316229