Skip to main content

On the Use of Anonymized Trace Data for Performance Evaluation in IP Routers

  • Conference paper
Managing Next Generation Networks and Services (APNOMS 2007)

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

Included in the following conference series:

  • 1029 Accesses

Abstract

For IP routers, it is important for realistic performance evaluation of address lookup algorithms to consider both routing table and trace data obtained from target network. However, most of trace data available are published after anonymizing personal information. Thus, the published trace data cannot be applied directly to estimate performance of routers. In this paper, we propose a new method for predicting more realistic router performance by using anonymized trace data. For our motivation, we analyze correlations of address space usage between real trace data and routing table. Based on analytic results, we also propose a method which transforms IP addresses in trace data by using statistics of address space usage in routing table. Through trace-driven simulation we show that our method can predict the routers’ performance closer to the actual one.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Caida internet measurement presentation, http://www.caida.org/

  2. Ruiz-Sanchez, M.A., Biersack, E.W., Dabbous, W.: Survey and taxonomy of IP address lookup algorithms. IEEE Network Magazine, 8–23 (March 2001)

    Google Scholar 

  3. Nilsson, S., Karlsson, G.: Fast address look-up for Internet routers. In: Proceedings of IEEE Broadband Communications 1998, Stuttgart, Germany, vol. 121, pp. 11–22. IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  4. Gupta, P., Prabhakar, B., Boyd, S.: Near-optimal routing lookups with bounded worst case performance. In: Proceedings of IEEE INFOCOM 2000, Tel Aviv, Israel, pp. 1184–1192. IEEE Computer Society Press, Los Alamitos (2000)

    Google Scholar 

  5. Narlikar, G., Zane, F.: Performance modeling for fast IP lookups. In: Proceedings of ACM SIGMETRICS 2001, vol. 29, pp. 1–12. ACM Press, New York (2001)

    Chapter  Google Scholar 

  6. Kawabe, R., Ata, S., Murata, M.: Address generation method based on traffic characteristics and its application to performance predictions of routers. IEICE technical report. Information networks, vol. 101, no. 716, 201–208 (2002)

    Google Scholar 

  7. Huston, G.: Nopeer community for border gateway protocol (bgp) route scope control (2004)

    Google Scholar 

  8. University of oregon route views project, http://www.routeviews.org/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Shingo Ata Choong Seon Hong

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Toji, Y., Ata, S., Oka, I. (2007). On the Use of Anonymized Trace Data for Performance Evaluation in IP Routers. In: Ata, S., Hong, C.S. (eds) Managing Next Generation Networks and Services. APNOMS 2007. Lecture Notes in Computer Science, vol 4773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75476-3_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75476-3_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75475-6

  • Online ISBN: 978-3-540-75476-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics