Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet
From MaRDI portal
Publication:5458296
Abstract: Traceroute sampling is an important technique in exploring the internet router graph and the autonomous system graph. Although it is one of the primary techniques used in calculating statistics about the internet, it can introduce bias that corrupts these estimates. This paper reports on a theoretical and experimental investigation of a new technique to reduce the bias of traceroute sampling when estimating the degree distribution. We develop a new estimator for the degree of a node in a traceroute-sampled graph; validate the estimator theoretically in Erdos-Renyi graphs and, through computer experiments, for a wider range of graphs; and apply it to produce a new picture of the degree distribution of the autonomous system graph.
Recommendations
Cited in
(8)- A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence
- Graph sampling for Internet topologies using normalized Laplacian spectral features
- On the bias of traceroute sampling
- Exploring networks with traceroute-like probes: Theory and simulations
- Relevance of massively distributed explorations of the internet topology: qualitative results
- On the bias of traceroute sampling
- Bounding the bias of tree-like sampling in IP topologies
- Detection, understanding, and prevention of traceroute measurement artifacts
This page was built for publication: Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458296)