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

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 694-703

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

^a MICROSOFT RESEARCH   (United States)

^b University of Southern California ^*  (United States)

^c University of New Mexico   (United States)

Author keywords

Internet mapping; Power laws; Random graphs

Indexed keywords

DEGREE DISTRIBUTIONS; INTERNET MAPPING; POWER LAWS; RANDOM GRAPHS;

ALGORITHMS; INTERNET; RANDOM PROCESSES; TREES (MATHEMATICS);

GRAPH THEORY;

EID: 34848922130     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060693     Document Type: Conference Paper

References (26)

1. L. Amini, A. Shaikh, and H. Schulzrinne. Issues with inferring Internet topological attributes. In SPIE IT-Com, 2002.
2. P. Barford, A. Bestavros, J. Byers, and M. Crovella. On the marginal utility of network topology measurements. In SIGCOMM Internet Measurement Workshop, 2001.
3. B. Bollobás. Random graphs. Academic Press, 1985.
4. B. Bollobás and F. Chung, The diameter of a cycle plus a random matching, SIAM J. Disc. Math., 1:328-333, 1988.
5. Q. Chen, H. Chang, R. Govindan, S. Jamin, S. J. Shenker, and W. Willinger, The origin of power laws in Internet topologies revisited, In Proc. 21st ACM SIGCOMM Conference, 2002.
6. A. Clauset and C. Moore, Accuracy and scaling phenomena in Internet mapping, Physical Review Letters, 94:018701, 2005.
7. P. Erdos and A. Rényi. On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci., 5:17-61, 1960.
8. A. Fabrikant, E. Koutsoupias, and C. Papadimitriou. Heuristically optimized trade-offs: A new paradigm for power laws in the Internet. In Proc. 29th Intl. Colloq. on Automata, Languages and Programming, pages 110-122, 2002.
9. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In Proc. ACM SIGCOMM Conference, pages 251-262, 1999.
10. R. Govindan and H. Tangmunarunkit. Heuristics for Internet map discovery. In Proc. 19th ACM SIGCOMM Conference, 2000.
11. W. Hoeffding. Probability inequalities for sums of bounded random variables. J. of the American Statistical Association, 58:13-30, 1963.
12. J. H. Kim. Poisson cloning model for random graphs. Preprint, 2004.
13. J. Kleinberg, S. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. The web as a graph: Measurements, models and methods. In Intl. Conf. on Combinatorics and Computing, 1999.
14. A. Lakhina, J. Byers, M. Crovella, and P. Xie. Sampling biases in IP topology measurements. In Proc. 22nd ACM SIGCOMM Conference, 2003.
15. J. Leguay, M. Latapy, T. Friedman, and K. Salamatian. Describing and simulating internet routes. Preprint cs.NI/0411051, 2004.
16. C. McDiarmid. Concentration. In M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, editors, Probabilistic Methods for Algorithmic Discrete Mathematics, pages 195-247. Springer, 1998.
17. M. Mihail, C. Papadimitriou, and A. Saberi. On certain connectivity properties of the Internet topology. In Proc. 35th ACM Symp. on Theory of Computing, 2003.
18. M. Molloy and B. Reed. A critical point for random graphs with a given degree sequence. Random Structures and Algorithms, 6:161-180, 1995.
19. M. Molloy and B. Reed. The size of the largest component of a random graph on a fixed degree sequence. Combinatorics, Probability and Computing, 7:295-306, 1998.
20. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1990.
21. J.-J. Pansiot and D. Grad. On routers and multicast trees in the Internet. ACM SIGCOMM Communication Review, 28:41-50, 1998.
22. T. Petermann and P. De Los Rios, Exploration of scale-free networks: do we measure the real exponents? Euro. Phys. Journal B, 38:201, 2004.
23. J. B. Seaborn. Hypergeometric Functions and Their Applications. Springer, 1991.
24. J. Spanier and K.B. Oldham. The exponential integral ei(x) and related functions. In An Atlas of Functions, chapter 37, pages 351-360. Hemisphere, 1987.
25. H.S. Wilf. generatingfunctionology. Academic Press, 1994.
26. N.C. Wormald. Models of random regular graphs. In J. Lamb and D. Preece, editors, London Math. Soc. Lecture Note Series, volume 276, pages 239-298, Cambridge University Press, 1999.