Abstract
By now it is well known that the distribution of node degrees in the graph induced by the peering arrangements between Autonomous Systems (ASs) exhibits power laws. The most appealing mathematical model that attempts to explain the power-law degree distribution was suggested by Barabási and Albert (the BA model). We introduce two new models that are extensions to the BA model: the “Incremental Edge Addition” (InEd) model, and the “Super-Linear Preferential Attachment” (SLiP) model. We prove that both our models are more successful in matching the power-law exponent, in producing leaves , and in producing a large dense core. Beyond mathematical analysis, we have also implemented our models as a synthetic network generator we call Tang (Tel Aviv Network Generator). Experimentation with Tang shows that the networks it produces are more realistic than those generated by other network generators.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert, R., Barabási, A.-L.: Topology of evolving networks: Local events and universality. Physical Review Letters 85(24), 5234–5237 (2000)
Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Bu, T., Towsley, D.: On distinguishing between Internet power-law generators. In: Proc. IEEE INFOCOM 2002, New-York, NY, USA (April 2002)
Chen, Q., Chang, H., Govindan, R., Jamin, S., Shenker, S., Willinger, W.: The origin of power laws in Internet topologies revisited. In: Proc. IEEE INFOCOM 2002, New-York, NY, USA (April 2002)
Erdős, P., Renyi, A.: On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutato Int. Kozl. 5, 17–61 (1960)
Feige, U., Kortsarz, G., Peleg, D.: The dense k-subgraph problem. Algorithmica 29(3), 410–421 (2001)
Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: An approach to universal topology generation. In: Proceedings of MASCOTS 2001 (August 2001)
Subramanian, L., Agarwal, S., Rexford, J., Katz, R.H.: Characterizing the Internet hierarchy from multiple vantage points. In: Proc. IEEE INFOCOM 2002, New-York, NY, USA (April 2002)
Siganos, G., Faloutsos, M., Faloutsos, P., Faloutsos, C.: Power-laws and the AS-level Internet topology. IEEE/ACM Trans. on Networking (2003) ( to appear)
Sagie, G., Wool, A.: A clustering approach for exploring the Internet structure. Technical Report EES2003-7, Dept. Electrical Engineering Systems, Tel Aviv University (2003), Available from http://www.eng.tau.ac.il/~yash/ees2003-7.ps
Sagie, G., Wool, A.: A clustering-based comparison of Internet topology models, (2003) (preprint)
Winick, J., Jamin, S.: Inet-3.0: Internet topology generator. Technical Report UM-CSE-TR-456-02, Department of EECS, University of Michigan (2002)
Wool, A.: TANG: Tel aviv university network generator, v1.4 (2004), Available from http://www.eng.tau.ac.il/~yash/topology/index.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bar, S., Gonen, M., Wool, A. (2004). An Incremental Super-Linear Preferential Internet Topology Model. In: Barakat, C., Pratt, I. (eds) Passive and Active Network Measurement. PAM 2004. Lecture Notes in Computer Science, vol 3015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24668-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-24668-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21492-2
Online ISBN: 978-3-540-24668-8
eBook Packages: Springer Book Archive