Accuracy and scaling phenomena in Internet mapping

Physical Review Letters

Volumn 94, Issue 1, 2005, Pages

  Clauset, Aaron ^a   Moore, Cristopher ^a,b  

^a University of New Mexico   (United States)

^b UNIVERSITY OF NEW MEXICO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BORDER GATEWAY PROTOCOL (BGP); COMPLEX NETWORKS; INTERNET MAPPING; POWER LAW; SCALING PHENOMENON;

APPROXIMATION THEORY; DIFFERENTIAL EQUATIONS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; MAPPING; NETWORK PROTOCOLS; POISSON DISTRIBUTION; SAMPLING;

INTERNET;

EID: 18144398615     PISSN: 00319007     EISSN: 10797114     Source Type: Journal    
DOI: 10.1103/PhysRevLett.94.018701     Document Type: Article

References (25)

1. J.-J. Pansiot and D. Grad, ACM SIGCOMM Computer Commun. Rev. 28, 41 (1998).
2. R. Govindan and H. Tangmunarunkit, in Proceedings of IEEE INFOCOM, Tel Aviv, 2000.
3. Internet Mapping Project, Lumeta Corp., http://research.lumeta.com/ches/ map/
4. CAIDA skitter Project., http://www.caida.org/
5. Opte Project, http://www.opte.org/
6. Autonomous Systems (ASs) use the Border Gateway Protocol (BGP) to route packets between networks. BGP routing tables represent logical domain adjacencies rather than physical connectivity. Tables contain advertised paths through this logical network; routing within domains is typically done via Open Shortest Path First or another distributed spanning tree protocol.
7. L. Amini, A. Shaikh, and H. Schulzrinne, in Internet Performance and Control of Network Systems III, Proceedings of SPIE ITCom, 2002.
8. University of Oregon Route-Views Project, http://www.antc.uoregon.edu/ route-views/
9. M. Faloutsos, P. Faloutsos, and C. Faloutsos, in ACM SIGCOMM Computer Commun. Rev. 29, 251 (1999).
10. N. Spring, R. Mahajan, and D. Wetherall, ACM SIGCOMM Computer Commun. Rev. 32, 133 (2002).
11. Traceroute Organization, http://www.traceroute.org/
12. Q. Chen et al., in Proceedings of IEEE INFOCOM, New York, New York, 2002.
13. P. Barford, A. Bestavros, J. Byers, and M. Crovella, in Proceedings of the ACM SIGCOMM Internet Measurement Workshop, San Francisco, CA, 2001.
14. R. Teixeira, K. Marzullo, S. Savage, and G. M. Voelker, in Proceedings of the ACM SIGCOMM Internet Measurement Workshop, Miami Beach, FL, 2003.
15. A. Lakhina, J. Byers, M. Crovella, and P. Xie, in Proceedings of IEEE INFOCOM, San Francisco, CA, 2003.
16. P. Erdo″s and A. Rényi, Publ. Math. Inst. Hung. Acad. Sci. 5, 17 (1960).
17. T. Petermann and P. De Los Rios, Eur. Phys. J. B 38, 201 (2004).
18. L. Dall'Asta et al., cond-mat/0406404.
19. While there are typically multiple shortest paths from the source to a given destination, their union forms a tree if we break ties, e.g., by giving each vertex an index and taking the first shortest path in lexicographic order.
20. L. A. Braunstein et al., Phys. Rev. Lett. 91, 168701 (2003).
21. N. C. Wormald, Ann. Appl. Probab. 5, 1217 (1995).
22. A.-L. Barabási and R. Albert, Science 286, 509 (1999).
23. B. Bollobás, Random Graphs (Academic Press, London, New York, 1985).
24. Z. Toroczkai and K. E. Bassler, Nature (London) 428, 716 (2004).
25. P. J. Macdonald, E. Almaas, and A.-L. Barabasi (to be published).