Skip to main content

Using Simple Per-Hop Capacity Metrics to Discover Link Layer Network Topology

  • 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:

  • 1840 Accesses

Abstract

At present, link layer topology discovery methodologies rely on protocols that are not universally available, such as SNMP. Such methodologies can only be applied to a subset of all possible networks. Our goal is to work towards a generic link layer topology discovery method that does not rely on SNMP. In this paper, we will present a new link layer topology discovery methodology based on variable packet size capacity estimation. We will also discuss the problems that arose from preliminary testing where different brands of network cards affected the capacity estimates used to detect serializations. As a result, topologically equivalent links fail to be classified as such by the capacity estimation tool. To circumvent this issue, non-VPS methods of capacity estimation that utilise back to back packet pairs have been investigated as a calibration technique.

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. Stott, D.T.: Layer-2 Path Discovery Using Spanning Tree MIBs. In: Avaya Labs Research, , Avaya Inc (March 7 2002)

    Google Scholar 

  2. Bejerano, Y., Breitbart, Y., Garofalakis, M., Rastogi, R.: Physical Topology Discovery in Large Multi-Subnet Networks. In: IEEE Infocom (2003)

    Google Scholar 

  3. Lowekamp, B., O’Hallaron, D.R., Gross, T.R.: Topology Discovery for Large Ethernet Networks. In: Proceedings of ACM SIGCOMM, San Diego, California (August 2001)

    Google Scholar 

  4. Prasad, R.S., Dovrolis, C., Mah, B.A.: The Effect of Layer-2 Store-and-Forward Devices on Per-Hop Capacity Estimation (2003), http://citeseer.ist.psu.edu/prasad03effect.html/

  5. Jacobson, V.: Pathchar: A Tool to Infer Characteristics of Internet Paths (April 1997), ftp://ftp.ee.lbl.gov/pathchar/

  6. Mah, B.A.: pchar: a Tool for Measuring Internet Path Characteristics (February 1999), http://www.employees.org/~bmah/Software/pchar/

  7. Downey, A.: clink: a Tool for Estimating Internet Link Characteristics (1999), http://allendowney.com/research/clink/

  8. http://www.wand.net.nz/~bcj3/emulation/

  9. Endace Measurement Systems, http://www.endace.com/networkMCards.htm

  10. Lai, K., Baker, M.: Measuring Link Bandwidths Using a Deterministic Model of Packet Delay. SIGCOMM, 283–294 (2000)

    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

Alcock, S., McGregor, A., Nelson, R. (2005). Using Simple Per-Hop Capacity Metrics to Discover Link Layer Network Topology. 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_13

Download citation

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

  • 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