Skip to main content

Revisiting Internet AS-Level Topology Discovery

  • Conference paper
Passive and Active Network Measurement (PAM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3431))

Included in the following conference series:

Abstract

The development of veracious models of the Internet topology has received a lot of attention in the last few years. Many proposed models are based on topologies derived from RouteViews [1] BGP table dumps (BTDs). However, BTDs do not capture all AS–links of the Internet topology and most importantly the number of the hidden AS–links is unknown, resulting in AS–graphs of questionable quality. As a first step to address this problem, we introduce a new AS–topology discovery methodology that results in more complete and accurate graphs. Moreover, we use data available from existing measurement facilities, circumventing the burden of additional measurement infrastructure. We deploy our methodology and construct an AS–topology that has at least 61.5% more AS–links than BTD–derived AS–topologies we examined. Finally, we analyze the temporal and topological properties of the augmented graph and pinpoint the differences from BTD–derived AS–topologies.

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. Meyer, D.: University of Oregon Route Views Project (2004)

    Google Scholar 

  2. Govindan, R., Tangmunarunkit, H.: Heuristics for Internet map discovery. In: IEEE INFOCOM 2000, Tel Aviv, Israel, pp. 1371–1380. IEEE, Los Alamitos (2000)

    Google Scholar 

  3. Claffy, K., Monk, T.E., McRobb, D.: Internet tomography. Nature (1999), http://www.caida.org/tools/measurement/skitter/

  4. Spring, N., Mahajan, R., Wetherall, D.: Measuring ISP topologies with Rocketfuel. In: ACM SIGCOMM (2002)

    Google Scholar 

  5. Spring, N., Wetherall, D., Anderson, T.: Scriptroute: A facility for distributed Internet measurement. In: USENIX Symposium on Internet Technologies and Systems, USITS (2003)

    Google Scholar 

  6. Shavitt, Y.: Distributed Internet MEasurements and Simulations, DIMES (2004), http://www.netdimes.org

  7. Friedman, T.: Work in progress on traceroute@home. In: ISMA - Internet Statistics and Metrics Analysis Workshops (2004)

    Google Scholar 

  8. Spring, N., Dontcheva, M., Rodrig, M., Wetherall, D.: How to Resolve IP Aliases, UW CSE Technical Report 04-05-04 (2004)

    Google Scholar 

  9. Keys, K.: iffinder (2002), http://www.caida.org/tools/measurement/iffinder/

  10. RIPE (2004), http://www.ripe.net

  11. A traceroute server list (2004), http://www.traceroute.org

  12. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. In: Proceedings of the ACM SIGCOMM (1999)

    Google Scholar 

  13. Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), pp. 171–180. ACM Press, New York (2000)

    Google Scholar 

  14. Chen, Q., Chang, H., Govindan, R., Jamin, S., Shenker, S.J., Willinger, W.: The origin of power laws in Internet topologies revisited. In: IEEE INFOCOM (2002)

    Google Scholar 

  15. Tangmunarunkit, H., Govindan, R., Jamin, S., Shenker, S., Willinger, W.: Network topology generators: Degree-based vs structural (2002)

    Google Scholar 

  16. Gao, L.: On inferring autonomous system relationships in the Internet. In: Proc. IEEE Global Internet Symposium (2000)

    Google Scholar 

  17. Siganos, G., Faloutsos, M.: Analyzing BGP policies: Methodology and tool. In: IEEE INFOCOM (2004)

    Google Scholar 

  18. Teixeira, R., Rexford, J.: A measurement framework for pin-pointing routing changes. In: ACM SIGCOMM Network Troubleshooting Workshop (2004)

    Google Scholar 

  19. Chang, H., Govindan, R., Jamin, S., Shenker, S.J., Willinger, W.: Towards capturing representative AS-level Internet topologies. Computer Networks Journal 44, 737–755 (2004)

    Article  Google Scholar 

  20. Mao, Z.M., Rexford, J., Wang, J., Katz, R.H.: Towards an accurate AS-level traceroute tool. In: ACM SIGCOMM (2003)

    Google Scholar 

  21. Andersen, D., Feamster, N., Bauer, S., Balakrishnan, H.: Topology Inference from BGP Routing Dynamics. In: Internet Measurement Workshop (2002)

    Google Scholar 

  22. Labovitz, C., Malan, G.R., Jahanian, F.: Internet routing instability. IEEE/ACM Transactions on Networking 6, 515–528 (1998)

    Article  Google Scholar 

  23. Chen, Q., Chang, H., Govindan, R., Jamin, S., Shenker, S., Willinger, W.: The origin of power laws in Internet topologies revisited. In: IEEE INFOCOM (2002)

    Google Scholar 

  24. Siganos, G., Faloutsos, M., Faloutsos, P., Faloutsos, C.: Power-laws and the AS-level Internet topology. IEEE Transactions on Networking (2003)

    Google Scholar 

  25. Maennel, O., Feldmann, A.: Realistic BGP Traffic for Test Labs. In: ACM SIGCOMM (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dimitropoulos, X.A., Krioukov, D.V., Riley, G.F. (2005). Revisiting Internet AS-Level Topology Discovery. In: Dovrolis, C. (eds) Passive and Active Network Measurement. PAM 2005. Lecture Notes in Computer Science, vol 3431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31966-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31966-5_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25520-8

  • Online ISBN: 978-3-540-31966-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics