An Efficient IP Lookup Architecture with Fast Update Using Single-Match TCAMs

  • Jinsoo Kim
  • Junghwan Kim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5031)

Abstract

The increasing demand for new multimedia services requires the higher performance routers. The performance of Internet router highly depends on the efficiency of update operations as well as lookup operations on IP forwarding table. While IP lookup schemes based on TCAM(Ternary Content Addressable Memory) can achieve high speed lookup, they usually need more complex update operations because of the ordering constraint on prefixes. In this paper we propose an efficient IP lookup architecture to provide fast update using a new type of TCAM named single-match TCAM. Also, we present elaborated algorithms to guarantee that each single-match TCAM generates at most one match for a given destination IP address. In our scheme the updating overhead can be reduced because there is no ordering constraint on the single-match TCAM. We evaluate as well the update performance of our scheme through simulation under real forwarding tables and update data.

Keywords

Internet router single-match TCAM IP lookup fast update 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ruiz-Sanchez, M.A., Biersack, E.W., Dabbous, W.: Survey and Taxonomy of IP Address Lookup Algorithms. IEEE Network 15, 8–23 (2001)CrossRefGoogle Scholar
  2. 2.
    Chao, H.J., Liu, B.: High Performance Switches and Routers. Wiley-Interscience, Chichester (2007)Google Scholar
  3. 3.
    Labovitz, C., Malan, G.R., Jahanian, F.: Internet Routing Instability. IEEE/ACM TON 6, 515–528 (1998)CrossRefGoogle Scholar
  4. 4.
    Shah, D., Gupta, P.: Fast Updating Algorithms for TCAMs. IEEE Micro 21, 36–47 (2001)CrossRefGoogle Scholar
  5. 5.
    Wu, W., Shi, B., Wang, F.: Efficient location of free spaces in TCAM to improve router per-formance. IJCS 18, 363–371 (2005)Google Scholar
  6. 6.
    Kobayashi, M., Murase, T., Kuriyama, A.: A Longest Prefix Match Search Engine for Multi-Gigabit IP Processing. In: 2000 International Conf. on Communications, pp. 1360–1364. IEEE Press, New Orleans (2000)Google Scholar
  7. 7.
    Ng, E., Lee, G.: Eliminating Sorting in IP Lookup Devices using Partitioned Table. In: 16th IEEE International Conf. on Application-Specific Systems, Architecture and Processors (ASAP), pp. 119–126. IEEE Press, Greece (2005)Google Scholar
  8. 8.
    Akhbarizadeh, M.J., Nourani, M., Cantrell, C.D.: Prefix Segregation Scheme for a TCAM-Based IP Forwarding Engine. IEEE Micro 25, 48–63 (2005)CrossRefGoogle Scholar
  9. 9.
    University of Oregon Route Views Project, http://www.routeviews.org/

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jinsoo Kim
    • 1
  • Junghwan Kim
    • 1
  1. 1.Department of Computer ScienceKonkuk UniversityChungbukKorea

Personalised recommendations