Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

What SNMP Data Can Tell Us about Edge-to-Edge Network Performance

  • Conference paper
Passive and Active Measurement (PAM 2013)

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

Included in the following conference series:

Abstract

With the high speeds of today’s networks, monitoring information is most of the time either summarized or sampled. This policy is even more profound in network backbones, where aggregation of data from several sources and in very high speeds is often observed. The Simple Network Management Protocol (SNMP) [5] is widely used to provide aggregated link usage data from network components. These data, even without a great amount of detail, provide a valuable source for network administrators, aiding decisions about network routing, provisioning and configuration. SNMP data are simple to collect and maintain, providing a low disk space for historical network usage log.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
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

Similar content being viewed by others

References

  1. Choi, B., Bhattacharyya, S.: On the accuracy and overhead of cisco sampled netflow. In: Proceedings of ACM SIGMETRICS Workshop on Large Scale Network Inference, LSNI (2005)

    Google Scholar 

  2. Coull, S., Collins, M., Wright, C., Monrose, F., Reiter, M.: On web browsing privacy in anonymized netflows. In: Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium, p. 23. USENIX Association (2007)

    Google Scholar 

  3. Estan, C., Varghese, G.: New directions in traffic measurement and accounting. ACM SIGCOMM Computer Communication Review 32, 323–336 (2002)

    Article  Google Scholar 

  4. Foukarakis, M., Antoniades, D., Antonatos, S., Markatos, E.: Flexible and high-performance anonymization of netflow records using anontool. In: Third International Conference on Security and Privacy in Communications Networks and the Workshops, SecureComm 2007, pp. 33–38. IEEE (2007)

    Google Scholar 

  5. Harrington, D., Presuhn, R., Wijnen, B.: An architecture for describing simple network management protocol (snmp) management frameworks. Technical report, rfc 3411 (December 2002)

    Google Scholar 

  6. He, Q., Dovrolis, C., Ammar, M.: On the predictability of large transfer tcp throughput. ACM SIGCOMM Computer Communication Review 35, 145–156 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Antoniades, D., Hu, K., Sim, A., Dovrolis, C. (2013). What SNMP Data Can Tell Us about Edge-to-Edge Network Performance. In: Roughan, M., Chang, R. (eds) Passive and Active Measurement. PAM 2013. Lecture Notes in Computer Science, vol 7799. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36516-4_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36516-4_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36515-7

  • Online ISBN: 978-3-642-36516-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics