On the emergence of highly variable distributions in the autonomous system topology

Computer Communication Review

Volumn 33, Issue 2, 2003, Pages 41-49

  Fayed, Marwan ^a   Krapivsky, Paul ^a,b   Byers, John W ^a   Crovella, Mark ^a   Finkel, David ^c   Redner, Sid ^a,b  

^a BOSTON UNIVERSITY   (United States)

^b Dept of Physics ^*  (United States)

^c Worcester Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTONOMOUS SYSTEM TOPOLOGY; EXPLANATORY MODEL; SIZE DISTRIBUTION;

GRAPH THEORY; MATHEMATICAL MODELS; MAXIMUM LIKELIHOOD ESTIMATION; TOPOLOGY;

AUTONOMOUS AGENTS;

EID: 18044394535     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/956981.956986     Document Type: Review

References (32)

1. W. Aiello, F. Chung, and L. Lu. Random evolution in massive graphs. In IEEE Symposium on Foundations of Computer Science (FOCS), Las Vegas, NV, October 2001.
2. R. Albert and A. Barabási. Topology of evolving networks: local events and universality. Phys. Rev. Lett., 85:5234-5237, 2000.
3. R. Albert and A. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74:47-97, January 2002.
4. D. Alderson, J. Doyle, R. Govindan, and W. Willinger. Toward an Optimization-Driven Framework for Designing and Generating Realistic Internet Topologies. In ACM HotNets-I, Princeton, NJ, October 2002.
5. A.-L. Barabási and R. Albert. Emergence of Scaling in Random Networks. Science, 286:509-512, October 1999.
6. Boston University Representative Internet Topology Generator (BRITE). At http://www.cs.bu.edu/brite.
7. T. Bu and D. Towsley. On Distinguishing between Internet Power Law Topology Generators. In Proceedings of IEEE INFOCOM, New York, NY, June 2002.
8. H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Towards Capturing Representative AS-Level Internet Topologies. Technical Report UM-CSE-TR-454-02, University of Michigan Computer Science, 2002.
9. H. Chang, S. Jamin, and W. Willinger. Inferring AS-level Internet Topology from Router-Level Path Traces. In Proceedings of SPIE ITCom 2001, Denver, CO, August 2001.
10. Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. The Origin of Power Laws in Internet Topologies Revisited. In Proceedings of IEEE INFOCOM, New York, NY, June 2002.
11. D. J. deS. Price. Networks of scientific papers. Science, 149:510, 1965.
12. D. J. deS. Price. A general theory of bibliometric and other cumulative advantage processes. J. Amer. Soc. Inform. Sci., 27:292, 1976.
13. A. Fabrikant, E. Koutsoupias, and C.H. Papadimitriou. Heuristically Optimized Trade-offs: A New Paradigm for Power Laws in the Internet. In International Colloqium on Automata, Languages, and Programming (ICALP), Malaga, Spain, July 2002.
14. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On Power-Law Relationships of the Internet Topology. In Proceedings of ACM SIGCOMM, pages 251-62, Cambridge, MA, September 1999.
15. M. Fayed, P. Krapivsky, J. Byers, M. Crovella, D. Finkel, and S. Redner. On the size distribution of autonomous systems. Technical Report BUCS-TR-2003-001, Boston University, January 2003.
16. R. Govindan and H. Tangmunarunkit. Heuristics for Internet Map Discovery. In Proceedings of IEEE INFOCOM, March 2000.
17. Internet Domain Survey. At http://http://www.isc.org/ids/.
18. P. L. Krapivsky and S. Redner. Organization of Growing Random Networks. Phys. Rev. E, 63:066123, 2001.
19. P. L. Krapivsky, S. Redner, and F. Leyvraz. Connectivity of Growing Random Networks. Phys. Rev. Lett., 85:4629-4632, 2000.
20. P. L. Krapivsky, G. J. Rodgers, and S. Redner. Degree distributions of growing networks. Phys. Rev. Lett., 86:5401, 2001.
21. D. Magoni and J. Pansiot. Analysis of the Autonomous System Network Topology. ACM SIGCOMM Computer Communication Review (CCR), 31(3):26-37, July 2001.
22. A. Medina, A. Lakhina, I. Malta, and J. Byers. BRITE: An Approach to Universal Topology Generation. In IEEE MASCOTS, Cincinnati, OH, August 2001.
23. A. Medina, I. Malta, and J. Byers. On the Origin of Power Laws in Internel Topologies. ACM SIGCOMM Computer Communication Review (CCR), 30(2): 18-28, April 2000.
24. M. Mihail, C. Gkantsidis, and E. Zegura. Speclral analysis of Internel topologies. In Proceedings of IEEE INFOCOM, April 2003.
25. M. Mihail and N. Visnoi. On generating graphs with prescribed degree sequences for complex nelwork modeling applications. In Proceedings of Approx. and Randomized Algorithms for Communication Networks (ARACNE), 2002.
26. S. Mossa, M. Barthélémy, H. Slanley, and L.A. Nunes Amaral. Truncation of Power Law Behavior in "Scale-Free" Nelwork Models due to Information Filtering. Phys. Rev. Lett., 88(13):138701, March 2002.
27. RouteViews Project at University of Oregon. At http://archive.routeviews. org/.
28. H.A. Simon. On a class of skew distribution functions. Biometrica, 42:425, 1955.
29. The Skitter Project. At http://www.caida.org/tools/measurement/skitter/.
30. H. Tangmunarunkit, J. Doyle, R. Govindan, S. Jamin, and S. Shenker. Does AS Size Determine Degree in AS Topology? ACM SIGCOMM Computer Communication Review (CCR), 31(5):7, October 2001.
31. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network Topology Generators: Degree-Based vs. Structural. In Proceedings of ACM SIGCOMM, Pittsburgh, PA, August 2002.
32. E. Zegura, K. Calvert, and M. J. Donahoo. A quantitative comparison of graph-based models for Internet topology. IEEE/ACM Transactions on Networking, 5(6), December 1997.