Skip to main content

On the Spectrum and Structure of Internet Topology Graphs

  • Conference paper
  • First Online:
Innovative Internet Computing Systems (IICS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2346))

Included in the following conference series:

Abstract

In this paper we study properties of the Internet topology on the autonomous system (AS) level. We find that the normalized Laplacian spectrum (nls) of a graph provides a concise fingerprint of the corresponding network topology. The nls of AS graphs remains stable over time in spite of the explosive growth of the Internet, but the nls of synthetic graphs obtained using the state-of-the-art topology generator Inet-2.1 is significantly different, in particular concerning the multiplicity of eigenvalue 1. We relate this multiplicity to the sizes of certain subgraphs and thus obtain a new structural classification of the nodes in the AS graphs, which is also plausible in networking terms. These findings as well as new power-law relationships discovered in the interconnection structure of the subgraphs may lead to a new generator that creates more realistic topologies by combining structural and power-law properties.

Partially supported by European Commission - Fet Open project COSIN IST-2001-33555, with funding provided by BBW Switzerland.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286:509–512, 1999.

    Article  MathSciNet  Google Scholar 

  2. T. Bu and D. Towsley. On distinguishing between Internet power law topology generators. In INFOCOM 2002, 2002. To appear.

    Google Scholar 

  3. K. Calvert, M. Doar, and E. W. Zegura. Modeling Internet topology. IEEE Communications Magazine, June 1997.

    Google Scholar 

  4. H. Chang, S. Jamin, and W. Willinger. Inferring AS-level Internet topology from router-level path traces. In SPIE ITCom 2001, Denver, CO, August 2001.

    Google Scholar 

  5. F.R.K. Chung. Spectral Graph Theory. Conference Board of the Mathematical Sciences, Providence, Rhode Island, 1997.

    Google Scholar 

  6. C. Diot. Sprint tier 1 IP backbone: Architecture, traffic characteristics, and some measurement results, 2001. http://talk.epfl.ch/talkdetail.php?talkId=42.

  7. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In SIGCOMM’99, 1999.

    Google Scholar 

  8. I. Farkas, I. Dernyi, A. Barabási, and T. Vicsek. Spectra of ”real-world” graphs: Beyond the semicircle law. Physical Review E, 64, August 2001.

    Google Scholar 

  9. R. Grone, R. Merris, and V. Sunder. The Laplacian spectrum of a graph. SIAM Journal on Matrix Analysis and Applications, 11(2):218–238, April 1990.

    Google Scholar 

  10. J. Hawkinson and T. Bates. RFC 1930: Guidelines for creation, selection, and registration of an autonomous system (AS). IETF, March 1996.

    Google Scholar 

  11. C. Jin, Q. Chen, and S. Jamin. Inet topology generator. Technical Report CSE-TR-433-00, EECS Department, University of Michigan, 2000.

    Google Scholar 

  12. A. Medina, I. Matta, and J. Byers. On the origin of power laws in Internet topologies. ACM Computer Communication Review, 30(2):18–28, 2000. April 2000.

    Google Scholar 

  13. K. Park and H. Lee. On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law internets. In SIGCOMM 2001, August 2001.

    Google Scholar 

  14. R. Pastor-Satorras, A. Vázquez, and A. Vespignani. Dynamical and correlation properties of the Internet. Physical Review Letters, 87(25):258701–1, 2001.

    Article  Google Scholar 

  15. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topologies, power laws, and hierarchy. Technical Report 01-746, Computer Science Department, University of Southern California, 2001.

    Google Scholar 

  16. L. Tauro, C. Palmer, G. Siganos, and M. Faloutsos. A simple conceptual model for the Internet topology. In Global Internet, San Antonio, Texas, November 2001.

    Google Scholar 

  17. D. Vukadinović, P. Huang, and T. Erlebach. Spectral analysis of Internet graphs. Technical Report 118, TIK Institute, ETH Zürich, 2001.

    Google Scholar 

  18. B.M. Waxman. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6(9):1617–1622, 1988.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vukadinović, D., Huang, P., Erlebach, T. (2002). On the Spectrum and Structure of Internet Topology Graphs. In: Unger, H., Böhme, T., Mikler, A. (eds) Innovative Internet Computing Systems. IICS 2002. Lecture Notes in Computer Science, vol 2346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48080-3_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-48080-3_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43790-1

  • Online ISBN: 978-3-540-48080-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics