Skip to main content

On Searching for Patterns in Traceroute Responses

  • Conference paper
Passive and Active Measurement (PAM 2014)

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

Included in the following conference series:

Abstract

We study active traceroute measurements from more than 1,000 vantage points towards a few targets over 24 hours or more. Our aim is to detect patterns in the data that correspond to significant operational events. Because traceroute data is complex and noisy, little work in this area has been published to date. First we develop a measure for the differences between successive traceroute measurements, then we use this measure to cluster changes across all vantage points and assess the meaning and descriptive power of these clusters. Large-scale operational events stand out clearly in our 3D visualisations; our clustering technique could be developed further to make such events visible to the operator community in near-real time.

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.

Similar content being viewed by others

References

  1. Allison, L.: Dynamic programming algorithm (dpa) for edit-distance, http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Dynamic/Edit/

  2. King, A., Huffaker, B., Dainotti, A., Claffy, K.: A coordinated view of the temporal evolution of large-scale internet events. In: First IMC Workshop on Internet Visualization, WIV 2012 (2012), http://ant.isi.edu/wiv2012/program.html

  3. Lad, M., Massey, D., Zhang, L.: Visualizing internet routing changes. IEEE Transactions on Visualization and Computer Graphics 12(6) (November 2006)

    Google Scholar 

  4. Levenshtein, V.I.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady 10, 707 (1966)

    MathSciNet  Google Scholar 

  5. Matteucci, M.: Hierarchical clustering algorithms, http://home.dei.polimi.it/matteucc/Clustering/tutorial_html/hierarchical.html

  6. Quan, L., Heidemann, J., Pradkin, Y.: Visualizing sparse internet events: network outages and route changes. In: First IMC Workshop on Internet Visualization, WIV 2012 (2012), http://ant.isi.edu/wiv2012/program.html

  7. RIPE Network Coordination Centre. Ripe atlas, https://atlas.ripe.net/

  8. Sibson, R.: Slink: An optimally efficient algorithm for the single-link cluster method. The Computer Journal 16(1), 30–34 (1973)

    Article  MathSciNet  Google Scholar 

  9. Singhal, A.: Modern information retrieval: a brief overview. IEEE Data Engineering Bulletin 24, 35–43 (2001)

    Google Scholar 

  10. Taylor, J.: How did dodo break the internet? (February 24, 2012), http://www.zdnet.com/how-did-dodo-break-the-internet-1339332390/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Brownlee, N. (2014). On Searching for Patterns in Traceroute Responses. In: Faloutsos, M., Kuzmanovic, A. (eds) Passive and Active Measurement. PAM 2014. Lecture Notes in Computer Science, vol 8362. Springer, Cham. https://doi.org/10.1007/978-3-319-04918-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04918-2_7

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04917-5

  • Online ISBN: 978-3-319-04918-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics