On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs

Journal of the ACM

Volumn 56, Issue 4, 2009, Pages

  Achlioptas, Dimitris ^c   Clauset, Aaron ^a,b,d   Kempe, David ^e   Moore, Cristopher ^b,f  

^a UNIVERSITY OF NEW MEXICO   (United States)

^b SANTA FE INSTITUTE   (United States)

^c Santa Cruz   (United States)

^d University of Southern California ^*

^e University of New Mexico ^*  (United States)

^f University of NewMexico   (United States)

Author keywords

Internet topology; Sampling bias; Traceroute

Indexed keywords

FORESTRY; GRAPH ALGORITHMS; GRAPH STRUCTURES; GRAPH THEORY; GRAPHIC METHODS; MACHINERY; POISSON DISTRIBUTION;

DEGREE DISTRIBUTIONS; INTERNET APPLICATION; INTERNET PROTOCOL ADDRESS; INTERNET TOPOLOGIES; POWER LAW DEGREE DISTRIBUTION; SAMPLING BIAS; SHORTEST PATH TREE; TRACEROUTE;

INTERNET PROTOCOLS;

EID: 68549135094     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1538902.1538905     Document Type: Article

References (37)

1. ALDERSON, D., LI, L., WILLINGER, W., AND DOYLE , J. 2005. Understanding Internet topology: Principles, models, and validation. IEEE/ACM Trans. Netw. 13, 1205-1218.
2. AMINI, L., SHAIKH, A., AND SCHULZRINNE, H. 2002. Issues with inferring Internet topological attributes. In SPIE IT-Com.
3. BARFORD, P., BESTAVROS, A., BYERS, J., AND CROVELLA, M. 2001. On the marginal utility of network topology measurements. In SIGCOMM Internet Measurement Workshop.
4. BLONDEL, V., GUILLAUME, J.-L., HENDRICKX, J., AND JUNGERS, R. 2007. Distance distribution in random graphs and application to network exploration. Phys. Rev. E 76, 066101.
5. BOLLOBAS, B. 2001. Random Graphs, 2nd ed. Cambridge University Press, Cambridge.
6. BOLLOBAS, B., AND CHUNG, F. 1988. The diameter of a cycle plus a random matching. SIAM J. Disc. Math. 1, 328-333.
7. CHEN, Q., CHANG, H., GOVINDAN, R., JAMIN, S., SHENKER, S., AND WILLINGER, W. 2002. The origin of power laws in Internet topologies revisited. In Proceedings of the 21st ACM SIGCOMM Conference. ACM, New York.
8. CLAUSET, A., AND MOORE, C. 2005. Accuracy and scaling phenomena in Internet mapping. Phys. Rev. Lett. 94, 018701.
9. COHEN, R., GONEN, M., AND WOOL, A. 2007. Bounding the bias of tree-like sampling in ip topologies. In Proceedings of the European Conference on Complex Systems (ECCS).
10. DALL'ASTA, L. 2007. Dynamic explorationof networks: From general principlestothe traceroute process. Europ. Phys. J. B 60, 123-133.
11. DALL'ASTA, L., ALVAREZ-HAMELIN, I., BARRAT, A., VAZQUEZ, A., AND VESPIGNANI, A. 2006. Exploring networks with traceroute-like probes: Theory and simulations. Theoret. Comput. Sci. 355, 6-24.
12. ERDOS P., AND RENYI, A. 1960. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5, 17-61.
13. FABRIKANT, A., KOUTSOUPIAS, E., AND PAPADIMITRIOU, C. 2002. Heuristically optimized trade-offs: A new paradigm for power laws in the internet. In Proceedings of the 29th International Colloguium on Automata, Languages and Programming. 110-122.
14. FALOUTSOS, M., FALOUTSOS, P., AND FALOUTSOS, C. 1999. On power-law relationships of the Internet topology. In Proceedings of the 18th ACM SIGCOMM Conference. ACM, New York. 251-262.
15. FLAXMAN, A., AND VERA, J. 2007. Bias reduction in traceroute sampling: Towards a more accurate map of the internet. In Proceedings of the 5th Workshop on Algorithms and Models for the Web-Graph (WAW2007).
16. GOVINDAN, R., AND TANGMUNARUNKIT, H. 2000. Heuristics for Internet map discovery. In Proceedings of the 19th ACM SIGCOMM Conference. ACM, New York.
17. GUILLAUME, J.-L., LATAPY, M., AND MAGONI, D. 2006. Relevance of massively distributed explorations of the internet topology: Qualitative results. Comput. Netw. 50, 3197-3224.
18. HOEFFDING, W. 1963. Probability inequalities for sums of bounded random variables. J. ASA 58, 13-30.
19. KIM, J. H. 2006. Poisson cloning model for random graphs. Preprint.
20. KLEINBERG, J., KUMAR, R., RAGHAVAN, P., RAJAGOPALAN, S., AND TOMKINS, A. 1999. The web as a graph: Measurements, models and methods. In Proceedings of the International Conference on Combinatorics and Computing.
21. LAKHINA, A., BYERS, J., CROVELLA, M., AND XIE, P. 2003. Sampling biases in IP topology measurements. In Proceedings of the 22nd IEEE INFOCOM Conference. IEEE Computer Society Press, Los Alamitos.
22. LEGUAY, J., LATAPY, M., FRIEDMAN, T., AND SALAMATIAN, K. 2007. Describing and simulating Internet routes. Comput. Netw. 51, 2067-2087.
23. MCDIARMID, C. 1998. Concentration. In Probabilistic Methods for Algorithmic Discrete Mathematics, M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, Eds. Springer-Verlag, Berlin, Germany, 195-247.
24. MIHAIL, M., PAPADIMITRIOU, C., AND SABERI, A. 2003. On certain connectivity properties of the Internet topology. In Proceedings of the 35th ACM Symposium on Theory of Computing. ACM, New York.
25. MOLLOY, M., AND REED, B. 1995. A critical point for random graphs with a given degree sequence. Rand. Struct. Algor. 6, 161-180.
26. MOLLOY, M., AND REED, B. 1998. The size of the largest component of a random graph on a fixed degree sequence. Combin. Probab. Comput. 7, 295-306.
27. MOTWANI, R., AND RAGHAVAN, P. 1990. Randomized Algorithms. Cambridge University Press. Cambridge.
28. PANSIOT, J.-J., AND GRAD, D. 1998. On routers and multicast trees in the Internet. ACM SIGCOMM Commun. Rev. 28, 41-50.
29. PETERMANN, T., AND DE LOS RIOS, P. 2004. Exploration of scale-free networks: Do we measure the real exponents? Euro. Phys. J. B 38, 201-204.
30. SEABORN, J. 1991. Hypergeometric Functions and Their Applications. Springer-Verlag, Berlin, Germany.
31. SHAVITT, Y., AND SHIR, E. 2005. Dimes: Let the Internet measure itself. ACM SIGCOMM Comput. Commun. Rev. 35, 71-74.
32. SPANIER, J., AND OLDHAM, K. 1987. The exponential integral ei(x) and related functions. In An Atlas of Functions. Hemisphere, Chapter 37, 351-360.
33. SPRING, N., MAHAJAN, R., WETHERALL, D., AND ANDERSON, T. 2004. Measuring ISP topologies with rocketfuel. IEEE/ACM Trans. Netw. 12, 2-16.
34. TANGMUNARUNKIT, H., GOVINDAN, R., SHENKER, S., AND ESTRIN, D. 2001. The impact of policy on Internet paths. In Proceedings of the 20th IEEE INFOCOM Conference. IEEE Computer Society Press, Los Alamitos.
35. VIGER, F., AUGUSTIN, B., CUVELLIER, X., MAGNIEN, C., LATAPY, M., FRIEDMAN, T., AND TEIXEIRA, R. 2006. Detection, understanding, and prevention of traceroute measurement artifacts. In Proceedings of the 6th Internet Measurement Conference (IMC'06).
36. WILF, H. 1994. Generatingfunctionology. Academic Press, Orlando, FL.
37. WORMALD, N. 1999. Models of random regular graphs. In London Math. Soc. Lecture Note Series, J. Lamb and D. Preece, Eds. Vol. 276. Cambridge University Press, Cambridge. 239-298.