Scalable Packet Classification for IPv6 by Using Limited TCAMs

  • Chia-Tai Chan
  • Pi-Chung Wang
  • Shuo-Cheng Hu
  • Chung-Liang Lee
  • Rong-Chang Chen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2662)

Abstract

It has been demonstrated that performing packet classification on a potentially large number of filters on key header fields is difficult and has poor worst-case performance. To achieve fast packet classification, hardware support is unavoidable. Ternary content-addressable memory (TCAM) has been widely used to perform fast packet classification due to its ability to solve the problem in O(1) time without considering the number of entries, mask continuity and their lengths. As compared to the software-based solutions, the TCAM can offer sustained throughput and simple system architecture. It is attractive for packet classification, especially for the ultimate IPv6-based networks. However, it also comes with several shortcomings, such as the limited number of entries, expansive cost and power consumption. Accordingly, we propose an efficient algorithm to reduce the required TCAM by encoding the address portion of the searchable entries. The new scheme could encrypt the 128-bit prefixes of the real-world IPv6 routing tables into 11 bits and still keeps the property of CIDR.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Waldvogel, M., Vargnese, G., Turner, J., Plattner, B.: Scalable High Speed IP Routing Lookups. In: Proc. ACM SIGCOMM 1997, Cannes, France, September 1997, pp. 25–36 (1997)Google Scholar
  2. 2.
    Srinivasan, V., Varghese, G., Suri, S.: Packet Classification using Tuple Space Search. In: ACM SIGCOMM, September 1999, pp. 135–146 (1999)Google Scholar
  3. 3.
    Gupta, P., McKeown, N.: Packet Classification on Multiple Fields. In: ACM SIGCOMM, September 1999, pp. 147–160 (1999)Google Scholar
  4. 4.
    Srinivasan, V., Varghese, G., Suri, S., Waldvogel, M.: Fast Scalable Level Four witching. In: ACM SIGCOMM, September 1998, pp. 191–202 (1998)Google Scholar
  5. 5.
    Lakshman, T.V., Stidialis, D.: High Speed Policy-based Packet Forwarding Using Efficient Multi-dimensional Range Matching. In: ACM SIGCOMM, September 1998, pp. 203–214 (1998)Google Scholar
  6. 6.
    Feldmann, A., Muthukrishnan, S.: Tradeoffs for Packet Classification. In: IEEE INFOCOM, March 2000, pp. 1193–1202 (2000)Google Scholar
  7. 7.
    Shah, D., Gupta, P.: Fast updating Algorithms for TCAMs. IEEE Micro Mag. 21(1), 36–47 (2001)CrossRefGoogle Scholar
  8. 8.
    Merit Networks, Inc. Internet Performance Measurement and Analysis (IPMA) Statistics and Daily Reports, See http://www.merit.edu/ipma/routing_table/
  9. 9.
    NLANR Project, See http://moat.nlanr.net/
  10. 10.
    Rekhter, Y., Li, T.: An Architecture for IP Address Allocation with CIDR. RFC 1518 (September 1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Chia-Tai Chan
    • 1
  • Pi-Chung Wang
    • 1
  • Shuo-Cheng Hu
    • 2
  • Chung-Liang Lee
    • 1
  • Rong-Chang Chen
    • 3
  1. 1.Telecommunication LaboratoriesChunghwa Telecom Co., Ltd.TaipeiTaiwan , R.O.C.
  2. 2.Department of Info. ManagementMing-Hsin University of Science and TechnologyHsinchuTaiwan , R.O.C.
  3. 3.Department of Logistics Engineering and ManagementNational Taichung Institute of TechnologyTaichungTaiwan , R.O.C.

Personalised recommendations