On the Bias of Traceroute Sampling or Power-law Degree Distributions in Regular Graphs教程.pdfVIP

On the Bias of Traceroute Sampling: or, Power-law Degree 6 0 Distributions in Regular Graphs 0 2 r Dimitris Achlioptas Aaron Clauset a M Microsoft Research Department of Computer Science Microsoft Corporation University of New Mexico 9 Redmond, WA 98052 Albuquerque, NM 87131 2 optas@ aaron@ ] n David Kempe Cristopher Moore n- Department of Computer Science Department of Computer Science s University of Southern California University of New Mexico i d Los Angeles, CA 90089 Albuquerque, NM 87131 . t dkempe@ moore@ a m- February 2, 2008 d n o Abstract c [ Understanding the structure of the Internet graph is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaining its graph structure 3 v is a surprisingly difficult task, as edges cannot be explicitly queried. Instead, empirical studies rely on 7 traceroutes to build what are essentially single-source, all-destinations, shortest-path trees. These trees 8 only sample a fraction of the network’s edges, and a recent paper by Lakhina et al. found empirically 0 that the resuting sample is intrinsically biase