The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Sampling biases in IP topology measurements
Abstract
Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led some to conclude that the router graph of the Internet is well modeled as a power-law random graph. In such a graph, the degree distribution of nodes follows a distribution with a power-law tail. We argue that the evidence to date for this conclusion is at best insufficient We show that when graphs are sampled using traceroute-like methods, the resulting degree distribution can differ sharply from that of the underlying graph. For example, given a sparse Erdos-Renyi random graph, the subgraph formed by a collection of shortest paths from a small set of random sources to a larger set of random destinations can exhibit a degree distribution remarkably like a power-law. We explore the reasons for how this effect arises, and show that in such a setting, edges are sampled in a highly biased manner. This insight allows us to formulate tests for determining when sampling bias is present. When we apply these tests to a number of well-known datasets, we find strong evidence for sampling bias.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
The Art of Computer Systems Performance Analysis.
Jain, R. (1990) · Int. CMG Conference · Cited by 2,280
Measuring ISP topologies with rocketfuel
Spring, N., Mahajan, R., & Wetherall, D. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633039 · Cited by 1,256
The Evolution of Random Graphs
Bollobas, B. (1984) · Transactions of the American Mathematical Society · doi:10.2307/1999405 · Cited by 1,023
The art of computer systems performance analysis
Chlamtac, I. (1992) · Journal of Molecular Graphics · doi:10.1016/0263-7855(92)80055-i · Cited by 1,020
Measuring ISP Topologies With Rocketfuel
Spring, N., Mahajan, R., Wetherall, D., & Anderson, T. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.822655 · Cited by 1,010
A random graph model for massive graphs
Aiello, W., Chung, F., & Lu, L. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing · doi:10.1145/335305.335326 · Cited by 917
Heuristics for Internet map discovery
Govindan, R., & Tangmunarunkit, H. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832534 · Cited by 687
Network topology generators: degree-based vs. structural
Tangmunarunkit, H., Govindan, R., Jamin, S., Shenker, S., & Willinger, W. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633040 · Cited by 375
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet
Fabrikant, A., Koutsoupias, E., & Papadimitriou, C. H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45465-9_11 · Cited by 310
The Diameter of Sparse Random Graphs
Chung, F., & Lu, L. (2001) · Advances in Applied Mathematics · doi:10.1006/aama.2001.0720 · Cited by 269
On routes and multicast trees in the Internet
Pansiot, J.-J., & Grad, D. (1998) · ACM SIGCOMM Computer Communication Review · doi:10.1145/280549.280555 · Cited by 218
Internet topology: connectivity of IP graphs:
Broido, A., & claffy, K. (2001) · SPIE Proceedings · doi:10.1117/12.434393 · Cited by 163
On the efficiency of multicast
Mieghem, P. V., Hooghiemstra, G., & van der Hofstad, R. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.974526 · Cited by 83
Cited by
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
Li, L., Alderson, D., Doyle, J. C., & Willinger, W. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129111 · Cited by 519
The internet AS-level topology: three data sources and one definitive metric
Mahadevan, P., Krioukov, D., Fomenkov, M., Dimitropoulos, X., claffy, K. C., & Vahdat, A. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1111322.1111328 · Cited by 338
Collecting the internet AS-level topology
Zhang, B., Liu, R., Massey, D., & Zhang, L. (2005) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1052812.1052825 · Cited by 285
Metadata
- Authors
- Lakhina, A., Byers, J. W., Crovella, M., & Xie, P.
- Venue
- IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
- Publisher
- IEEE
- Published
- 2004-03-02
- Volume
- 1
- Pages
- 332-341
- OpenAlex
- W2107648668
- Cited by
- 303
- References
- 17
- FWCI
- 59.76
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.