A detailed study of the attachment strategies of new autonomous systems in the as connectivity graph

Internet Mathematics

Volumn 2, Issue 2, 2005, Pages 185-246

  Daubechies, Ingrid ^a   Drakakis, Konstantinos ^b   Khovanova, Tanya ^c  

^a PRINCETON UNIVERSITY   (United States)

^b JCMB   (United Kingdom)

^c NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 36348962525     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2005.10129103     Document Type: Article

References (16)

1. R. Albert and A.-L. Barabási. “Statistical Mechanics of Complex Networks.” Reviews of Modern Physics 74 (2002), 47.
2. A.-L. Barabási and R. Albert. “Emergence of Scaling in Random Networks.” Science 286 (1999), 509–512.
3. B. Bollobás. Random Graphs, Second edition. Cambridge, UK: Cambridge University Press, 2001.
4. A. Broido, E. Nemeth, and K. C. Claffy. “Internet Expansion, Refinement and Churn.” European Transactions on Telecommunications 13:1 (2002), 33–51.
5. D. Callaway, J. Hopcroft, J. Kleinberg, M. Newman, and S. Strogatz. “Are Randomly Grown Graphs Really Random?” Physical Review E 64 (2001), 041902.
6. H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. “Towards Capturing Representative AS-Level Internet Toplogies.” Computer Networks 44 (2004), 737–755.
7. Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. “The Origin of Power Laws in Internet Toplogies Revisited.” In Proceedings of IEEE INFOCOM 2002, the 21st Annual Joint Conference of the IEEE Computer and Communications Societies, CD-ROM. IEEE Press, 2002.
8. S. Floyd and E. Kohler. “Internet Research Needs Better Models.” ACM SIGGRAPH Computer Communication Review 33:1 (2003), 29–34.
9. A. Medina, I. Matta, and J. Byers. “On the Origin of Power Laws in Internet Topologies.” ACM Computer Communication Review 30:2 (2000), 18–28.
10. M. Mihail, Ch. Gkantsidis, A. Saberi, and E. Zegura. “On the Semantics of Internet Topologies.” Technical report GIT-CC-02-07, College of Computing, Georgia Institute of Technology, 2002.
11. M. Molloy and B. Reed. “A Critical Point for Random Graphs with a Given Degree Sequence.” Random Structures and Algorithms 6 (1995), 161.
12. National Research Council, editor. The Internet’s Coming of Age. Washington, DC: National Academies Press, 2001.
13. G. Siganos, M. Faloutsos, P. Faloutsos, and C. Faloutsos. “Power- Laws and the AS-level Internet Topology.” IEEE/ACM Transactions on Networking 11:4 (2003), 514–524.
14. H. Tangmunarunkit, J. Doyle, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. “Does AS Size Determine Degree in AS Topology?” ACM Computer Communication Review 31:5 (2001), 7–8.
15. W. Willinger, R. Govindan, S. Jamin, V. Paxson, and S. Shenker. “Scaling Phenomena in the Internet: Critically Examining Criticality.” PNAS 99 Suppl. 1 (2002), 2573–2580.
16. E. W. Zegura, K. L. Calvert, M. J. Donahoo. “A Quantitative Comparison of Graph-based Models for Internet Topology.” IEEE/ACM Transactions on Networking 5:6 (1997), 770–783.