Marwan Fayed
Mark Crovella
Abstract
Recent studies observe that vertex degree in the autonomous systems (AS) graph exhibits a highly variable distribution [14, 21]. The most prominent explanatory model for this phenomenon is the Barabasi-Albert (B-A) model [5, 2]. A central feature of the B-A model is preferential connectivity --- meaning that the likelihood a new node in a growing graph will connect to an existing node is proportional to the existing node's degree. In this paper we ask whether a more general explanation than the B-A model, and absent the assumption of preferential connectivity, is consistent with empirical data. We are motivated by two observations: first, AS degree and AS size are highly correlated [10]; and second, highly variable AS size can arise simply through exponential growth. We construct a model incorporating exponential growth in the size of the Internet and in the number of ASes, and show that it yields a size distribution exhibiting a power-law tail. In such a model, if an AS's link formation is roughly proportional to its size, then AS out-degree will also show high variability. Moreover, our approach is more flexible than previous work, since the choice of which AS to connect to does not impact high variability, thus can be freely specified. We instantiate such a model with empirically derived estimates of historical growth rates and show that the resulting degree distribution is in good agreement with that of real AS graphs.
- 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. Google Scholar
Digital Library
- R. Albert and A. Barabási. Topology of evolving networks: local events and universality. Phys. Rev. Lett., 85:5234--5237, 2000.Google ScholarCross Ref
- R. Albert and A. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74:47--97, January 2002.Google ScholarCross Ref
- 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.Google Scholar
- A.-L. Barabási and R. Albert. Emergence of Scaling in Random Networks. Science, 286:509--512, October 1999.Google Scholar
- Boston University Representative Internet Topology Generator (BRITE). At http://www.cs.bu.edu/brite.Google Scholar
- T. Bu and D. Towsley. On Distinguishing between Internet Power Law Topology Generators. In Proceedings of IEEE INFOCOM, New York, NY, June 2002.Google Scholar
- 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.Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- D. J. deS. Price. Networks of scientific papers. Science, 149:510, 1965.Google ScholarCross Ref
- D. J. deS. Price. A general theory of bibliometric and other cumulative advantage processes. J. Amer. Soc. Inform. Sci., 27:292, 1976.Google ScholarCross Ref
- 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), Málaga, Spain, July 2002. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- R. Govindan and H. Tangmunarunkit. Heuristics for Internet Map Discovery. In Proceedings of IEEE INFOCOM, March 2000.Google ScholarCross Ref
- Internet Domain Survey. At http://http://www.isc.org/ids/.Google Scholar
- P. L. Krapivsky and S. Redner. Organization of Growing Random Networks. Phys. Rev. E, 63:066123, 2001.Google ScholarCross Ref
- P. L. Krapivsky, S. Redner, and F. Leyvraz. Connectivity of Growing Random Networks. Phys.Rev.Lett., 85:4629--4632, 2000.Google ScholarCross Ref
- P. L. Krapivsky, G. J. Rodgers, and S. Redner. Degree distributions of growing networks. Phys. Rev. Lett., 86:5401, 2001.Google ScholarCross Ref
- D. Magoni and J. Pansiot. Analysis of the Autonomous System Network Topology. ACM SIGCOMM Computer Communication Review (CCR), 31(3):26--37, July 2001. Google ScholarDigital Library
- A. Medina, A. Lakhina, I. Matta, and J. Byers. BRITE: An Approach to Universal Topology Generation. In IEEE MASCOTS, Cincinnati, OH, August 2001. Google ScholarDigital Library
- A. Medina, I. Matta, and J. Byers. On the Origin of Power Laws in Internet Topologies. ACM SIGCOMM Computer Communication Review (CCR), 30(2):18--28, April 2000. Google ScholarDigital Library
- M. Mihail, C. Gkantsidis, and E. Zegura. Spectral analysis of Internet topologies. In Proceedings of IEEE INFOCOM, April 2003.Google Scholar
- M. Mihail and N. Visnoi. On generating graphs with prescribed degree sequences for complex network modeling applications. In Proceedings of Approx. and Randomized Algorithms for Communication Networks (ARACNE), 2002.Google Scholar
- S. Mossa, M. Barthelemy, H. Stanley, and L. A. Nunes Amaral. Truncation of Power Law Behavior in "Scale-Free" Network Models due to Information Filtering. Phys. Rev. Lett., 88(13):138701, March 2002.Google ScholarCross Ref
- Route Views Project at University of Oregon. At http://archive.routeviews.org/.Google Scholar
- H. A. Simon. On a class of skew distribution functions. Biometrica, 42:425, 1955.Google ScholarCross Ref
- The Skitter Project. At http://www.caida.org/tools/measurement/skitter/.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
Index Terms
- On the emergence of highly variable distributions in the autonomous system topology
Recommendations
Analysis of the autonomous system network topology
Mapping the Internet is a major challenge for network researchers. It is the key to building a successful modeling tool able to generate realistic graphs for use in networking simulations. In this paper we provide a detailed analysis of the inter-domain ...
Optimal Route Reflection Topology Design
LANC '18: Proceedings of the 10th Latin America Networking ConferenceAutonomous Systems (ASes) exchange routing information about networks they can reach in the Internet, and the most widely extended way to connect them is by means of Border Gateway Protocol (BGP) sessions. ASes set up external BGP (eBGP) sessions ...
Cutting Through the Noise to Infer Autonomous System Topology
IEEE INFOCOM 2022 - IEEE Conference on Computer CommunicationsThe Border Gateway Protocol (BGP) is a distributed protocol that manages interdomain routing without requiring a centralized record of which autonomous systems (ASes) connect to which others. Many methods have been devised to infer the AS topology from ...
Comments