How accurate aretraceroute-like Internet mappings?

Mapping the Internet generally consists in sampling the network from a limited set of sources by usingtraceroutelike probes. This methodology, akin to the merging of different spanning trees to a set of destinations, has been argued to introduce uncontrolled sampling biases that might produce statistical properties of the sampled graph which sharply differ from the original ones[1, 2, 3]. In this paper we study numerically how the fraction of vertices and edges discovered in the sampled graph depends on the particular deployments of probing sources. The results might hint the steps toward more efficient mapping strategies