A geographic directed preferential internet topology model

Computer Networks

Volumn 51, Issue 14, 2007, Pages 4174-4188

  Bar, Sagy ^a   Gonen, Mira ^a   Wool, Avishai ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

AS graph; Autonomous Systems; Dense core; Peering arrangements; Power law exponent; Synthetic network generator

Indexed keywords

AUTONOMOUS AGENTS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS;

AS-GRAPH; AUTONOMOUS SYSTEMS; CLUSTERING STRUCTURE; DENSE CORE; PEERING ARRANGEMENTS; POWER-LAW EXPONENT; SYNTHETIC NETWORK GENERATOR;

INTERNET;

EID: 34547220985     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2007.04.021     Document Type: Article

References (51)

1. Albert R., and Barabási A.-L. Topology of evolving networks: local events and universality. Physical Review Letters. 85 24 (2000) 5234-5237 December
2. W. Aiello, F. Chung, L. Lu. Random evolution in massive graphs, in: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), 2001, pp. 510-519.
3. Albert R., Jeong H., and Barabási A.-L. Error and attack tolerance of complex networks. Nature 406 (2000) 378-382
4. A. Akella, B. Maggs, S. Seshan, A. Shaikh, R. Sitaraman, A measurement-based analysis of multihoming, in: Proceedings of the ACM SIGCOMM, 2003.
5. Barabási A.-L., and Albert R. Emergence of scaling in random networks. Science 286 (1999) 509-512
6. Bianconi G., and Barabási A.L. Competition and multiscaling in evolving networks. Europhysics Letters 54 4 (2001) 436-442
7. B. Bollobás, C. Borgs, J. Chayes, O. Riordan, Directed scale-free graphs. in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 132-139.
8. S. Bar, M. Gonen, A. Wool, An incremental super-linear preferential Internet topology model, in: Proceedings of the Fifth Annual Passive & Active Measurement Workshop (PAM), LNCS vol. 3015, Springer-Verlag, Antibes Juan-les-Pins, France, April 2004, pp. 53-62.
9. G. Battista, M. Patrignani, M. Pizzonia, Computing the types of the relationships between autonomous systems, in: Proceedings of the IEEE INFOCOM, March 2003.
10. D. Ben-Avraham, A.F. Rozenfeld, R. Cohen, S. Havlin, Geographical embedding of scale-free networks, in: Randomness and Complexity, 2003.
11. Brunet R.X., and Sokolov I.M. Evolving networks with disadvantaged long-range connections. Physical Review E 66 026118 (2002)
12. T. Bu, D. Towsley, On distinguishing between Internet power-law generators, in: Proceedings of the IEEE INFOCOM'02, New York, NY, USA, April 2002.
13. IPv4 BGP geopolitical analysis. , 2004.
14. Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, W. Willinger. The origin of power laws in Internet topologies revisited, in: Proceedings of the IEEE INFOCOM'02, New York, NY, USA, April 2002.
15. Cohen R., Erez K., Ben-Avraham D., and Havlin S. Resilience of the Internet to random breakdowns. Physical Review Letters. 85 21 (2000) 4626-4628
16. H. Chang, R. Govindan, S. Jamin, S. Shenker, W. Willinger, Towards capturing representative as-level Internet topologies, in: Proceedings of the ACM SIGCOMM, 2002.
17. Callaway D., Hopcroft J., Kleinberg J., Newman M., and Strogatz S.H. Are randomly grown graphs really random. Physical Review Letters. 64 (2001)
18. H. Chang, S. Jamin, W. Willinger, To peer or not to peer: modeling the evolution of the Internet's AS-level topology, in: Proceedings of the IEEE INFOCOM, April 2006.
19. Chung F., and Lu L. Connected components in random graphs with given expected degree sequences. Annals of Combinatorics 6 (2002) 125-145
20. A. Clauset, C. Moore, Traceroute sampling makes random graphs appear to have power law degree distributions, 2004. arXiv: cond-mat/0312674.
21. A. Clauset, C. Moore, Why mapping the Internet is hard, 2004. arXiv: cond-mat/0407339.
22. D. Dolev, S. Jamin, O. Mokryn, Y. Shavitt, Internet resiliency to attacks and failures under bgp policy routing, Technical Report 2003-79, Dept. Computer Science, The Hebrew University, 2003. .
23. Dorogovtsev S.N., Mendes J.F.F., and Samukhin A.N. Giant strongly connected component of directed networks. Physical Review E 64 (2001)
24. Erdo{combining double acute accent}s P., and Renyi A. On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutato Int. Kozl. 5 (1960) 17-61
25. Feige U., Kortsarz G., and Peleg D. The dense k-subgraph problem. Algorithmica 29 3 (2001) 410-421
26. Gao L. On inferring autonomous system relationships in the Internet. IEEE/ACM Transactions on Networking 9 (2001) 733-745
27. S.P. Gorman and R. Kulkarni, Spatial small worlds: new geographic patterns for information economy, 2003. arXiv:cond-mat/0310426.
28. C. Gkantsidis, M. Mihail, E. Zegura, Spectral analysis of Internet topologies, in: Proceedings of the IEEE INFOCOM'03, New York, NY, USA, April 2003.
29. L. Gao, F. Wang, The extent of AS path inflation by routing policies, in: Proceedings of the IEEE Global Internet Symposium, 2002.
30. Jost J., and Joy M.P. Evolving networks with distance preferences. Physical Review E 66 036126 (2002)
31. Krapivsky P.L., Rodgers G.J., and Render S. Degree distributions of growing networks. Physical Review Letters 86 (2001) 5401
32. Lakhina A., Byers J.W., Crovella M., and Matta I. On the geographic location of Internet resources. IEEE Journal on Selected Areas in Communications 21 (2003) 934-948
33. A. Lakhina, J.W. Byers, M. Crovella, P. Xie, Sampling biases in IP topology measurements, in: Proceedings of the IEEE INFOCOM'03, 2003.
34. Li X., and Chen G. A local-world evolving network model. Physica A 328 (2003) 274-286
35. H. Lee, A. Perrig, D. Smith, BASE: an incrementally deployable mechanism for viable IP spoofing prevention, Manuscript, 2004.
36. A. Medina, A. Lakhina, I. Matta, J. Byers, BRITE: an approach to universal topology generation, in: Proceedings of MASCOTS'01, August 2001.
37. Molloy M., and Reed B. A critical point for random graphs with a given degree sequence. Structures and Algorithms 6 (1995) 161-180
38. Newman M.E.J., Strogatz S.H., and Watts D.J. Random graphs with arbitrary degree distributions and their applications. Physical Review Letters. 64 (2001)
39. Petermann T., and De Los Rios P. Exploration of scale-free networks - do we measure the real exponents?. Europhysics Letters 38 (2004) 201-204
40. Reittu H., and Norros I. On the power law random graph model of the Internet. Performance Evaluation 55 (2004)
41. L. Subramanian, S. Agarwal, J. Rexford, R.H. Katz, Characterizing the Internet hierarchy from multiple vantage points, in: Proceedings of the IEEE INFOCOM'02, New York, NY, USA, April 2002.
42. Siganos G., Faloutsos M., Faloutsos P., and Faloutsos C. Power-laws and the AS-level Internet topology. IEEE/ACM Transactions on Networking 11 (2003) 514-524
43. Y. Shavitt, E. Shir, DIMES: let the Internet Measure Itself. 2005. .
44. G. Sagie, A. Wool, A clustering approach for exploring the Internet structure, in: Proceedings of the 23rd IEEE Convention of Electrical & Electronics Engineers in Israel (IEEEI), September 2004.
45. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, W. Willinger, Network topology generators: degree based vs. structural, in: Proceedings of the ACM SIGCOMM, 2002.
46. L. Tauro, C. Palmer, G. Siganos, M. Faloutsos, A simple conceptual model for Internet topology, in: IEEE Global Internet, San Antonio, TX, November 2001.
47. W. Willinger, R. Govindan, S. Jamin, V. Paxson, and S. Shenker, Scaling phenomena in the Internet: critically examining criticality, in: Proceedings of the National Academy of Sciences of the United States of America, vol. 99, February 2002, pp. 2573-2580.
48. Jared Winick and Sugih Jamin. Inet-3.0: Internet topology generator. Technical Report UM-CSE-TR-456-02, Department of EECS, University of Michigan, 2002.
49. J. Wang, X. Liu, and A.A. Chien, Empirical study of tolerating denial-of-service attacks with a proxy network, in: 14th USENIX Security Symposium, August 2005, pp. 51-64.
50. Warren C.P., Sander L.M., and Sokolov I.M. Geography in a scale-free network model. Physical Review E 66 056105 (2002)
51. Zhou S., and Mondragon R.J. The rich-club phenomenon in the Internet topology. IEEE Communications Letters 8 3 (2004)