Advertisement

Accelerating Computation Bounded IP Lookup Methods by Adding Simple Instructions

  • Hossein Mohammadi
  • Nasser Yazdani
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3262)

Abstract

Most of software-based IP lookup methods are memory bounded so their speed depends on memory technology. However, some of them are computation bounded, meaning that their memory time is less than computation. In this paper, we present general ideas to ask simple supports from hardware to accelerate an IP lookup method and as our main case we show that IP Lookup using DMP-Tree data structure is computation bounded and we accelerate this method by adding simple instructions to the running processor. We present hardware implementation of new instructions and resulted IP lookup speed.

Keywords

Memory Access Clock Cycle Simple Instruction General Purpose Processor Memory Access Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Yazdani, N., Min, P.S.: Fast and Salable Schemes for IP Lookup Problem. In: Proc. of IEEE Conf. on High Performance Switching and Routing, Heidelberg Germany (June 2000)Google Scholar
  2. 2.
    Mohammadi, H., Yazdani, N., Robatmili, B., Nourani, M.: HASIL: Hardware Assisted Software-based IP Lookup for Large Routing Tables. In: Proceeding of the 11th IEEE International conference on networks (ICON) 2003, Sydney – Australia, pp. 99–105 (2003)Google Scholar
  3. 3.
    Yazdani, N., Mohammadi, H.: IP Lookup in Software for Large Routing Tables Using DMP-Tree Data Structure. In: Proc. of the 9th Asia Pacific Conference on Communications, APCC (2003)Google Scholar
  4. 4.
    Mohammadi, H., Robatmili, B., Ghasemi, H.R., Yazdani, N., Nourani, M.: Line-speed IP Lookup Using Improved Functional Units. In: Proc. Of the 9th Iranian Conference of Computer Science (CSICC) 2004, Tehran, Iran, pp. 97–102 (2004)Google Scholar
  5. 5.
    Robatmili, B., Mohammadi, H., Ghasemi, H.R., Yazdani, N.: Augmenting General Purpose Processors for Network Processing. In: Proc. Of the 2nd Conf. of Field Programmable Technology, 2003, Tokyo, Japan (2003)Google Scholar
  6. 6.
    Waldvogel, M., Varghese, G., et al.: Scalable High Speed IP Routing Lookups. In: Proc. of ACM SIGCOM 1997, Cannes, France, pp. 25–35 (1997)Google Scholar
  7. 7.
    Degermark, M., Brodnik, A., Carlsson, S., Pink, S.: Small Forwarding Tables for Fast Routing Lookups. In: Proceeding of ACM SIGCOM 1997 Conf., Cannes, France, pp. 3–14 (1997)Google Scholar
  8. 8.
    Doeringer, W., Karjoth, G., Nassehi, M.: Routing On Longest Matching Prefixes. IEEE/ACM Trans. Net. 4, 86–97 (1996)CrossRefGoogle Scholar
  9. 9.
    Lampson, B., Srinivasan, V., Varghese, G.: IP Lookups Using Multiway and Multicolumn Search. Proc. IEEE Infocom (1998)Google Scholar
  10. 10.
    Sahni, S., Kim, K.S.: Efficient Construction of Variable-Stride Multibit Tries For IP Lookup. In: Proceedings IEEE Symposium on Applications and the Internet, SAINT (2002)Google Scholar
  11. 11.
    Nilsson, S., Karlsson, G.: IP Address Lookups Using LC-Tries. IEEE JSAC 17(6), 1083–1092 (1999)Google Scholar
  12. 12.
    Yazdani, N., Salimi, N.: Performing IP Lookup on Very High Line Speed.In: Proceeding of ICT 2002, Shiraz, Iran (2002)Google Scholar
  13. 13.
    McKeown, N., Gupta, P., Lin, S.: Routing Lookups in Hardware at Memory Access Speeds. In: Proceeding of IEEE Infocom 1998 Conf., pp. 1240–1247 (1998)Google Scholar
  14. 14.
    Chen, W.E., Tsai, C.J.: A fast and scalable IP lookup scheme for high-speed networks .Proceedings of IEEE ICON (1999)Google Scholar
  15. 15.
    Cormen, T., Leiserson, C., Rivest, R., Stein: Introduction to Algorithms. MIT Univ. Press, Cambridge (2001)zbMATHGoogle Scholar
  16. 16.
    Tzeng, H.Y.: Longest Prefix Search Using Compressed Trees. In: proceeding of IEEE GlobCom 1998 Conf., Sydney, Australia (1998)Google Scholar
  17. 17.
    Lampson, B., Srinivasan, V., Varghese, G.: IP Lookups Using Multiway and Multicolumn Search. In: Proceeding of IEEE Infocom 1998 Conf., San Francisco, CA, pp. 1247–1256 (1998)Google Scholar
  18. 18.
    Chiueh, T.-C., Pradhan, P.: High Performance IP Routing Lookup Using CPU Caching. In: Proceeding of IEEE Infocom (1999)Google Scholar
  19. 19.
    Liu, H.: Routing Prefix Caching in Network Processor Design. In: Proc. International Conference on Computer Communications and networks (ICCCN), Phoenix, AZ (2001)Google Scholar
  20. 20.
    McKeown, N., Gupta, P., Lin, S.: Routing Lookups in Hardware at Memory Access Speeds. In: Proceeding of IEEE Infocom 1998 Conf., pp. 1240–1247 (1998)Google Scholar
  21. 21.
    Yazdani, N., Mohammadi, H.: DMP-Tree: A Dynamic M-way Tree Data Structure for String Matching. Elsevier Journal of Algorithms (submitted to)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Hossein Mohammadi
    • 1
  • Nasser Yazdani
    • 2
  1. 1.Computer Engineering DepartmentIslamic Azad University of ZanjanZanjanIran
  2. 2.Router Laboratories, ECE DepartmentUniversity of TehranTehranIran

Personalised recommendations