Network Inference from TraceRoute Measurements: Internet Topology `Species'
Fabien Viger, Alain Barrat, Luca Dall'Asta, Cun-Hui Zhang, and Eric D., Kolaczyk

TL;DR
This paper explores the challenge of estimating the total number of nodes in Internet topology maps derived from traceroute measurements, framing it as a statistical species problem and proposing estimators to improve accuracy.
Contribution
It introduces the novel perspective of viewing Internet topology inference as a species problem and develops estimators for network size based on this approach.
Findings
Proposed two estimators for network size from traceroute data.
Analyzed the difficulty of estimating network size analytically.
Demonstrated estimator performance on various network topologies.
Abstract
Internet mapping projects generally consist in sampling the network from a limited set of sources by using traceroute probes. This methodology, akin to the merging of spanning trees from the different sources to a set of destinations, leads necessarily to a partial, incomplete map of the Internet. Accordingly, determination of Internet topology characteristics from such sampled maps is in part a problem of statistical inference. Our contribution begins with the observation that the inference of many of the most basic topological quantities -- including network size and degree characteristics -- from traceroute measurements is in fact a version of the so-called `species problem' in statistics. This observation has important implications, since species problems are often quite challenging. We focus here on the most fundamental example of a traceroute internet species: the number of nodes…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
