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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Srinivasan, V., Varghese, G., Suri, S.: Packet Classification using Tuple Space Search. In: ACM SIGCOMM, September 1999, pp. 135–146 (1999)
Gupta, P., McKeown, N.: Packet Classification on Multiple Fields. In: ACM SIGCOMM, September 1999, pp. 147–160 (1999)
Srinivasan, V., Varghese, G., Suri, S., Waldvogel, M.: Fast Scalable Level Four witching. In: ACM SIGCOMM, September 1998, pp. 191–202 (1998)
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)
Feldmann, A., Muthukrishnan, S.: Tradeoffs for Packet Classification. In: IEEE INFOCOM, March 2000, pp. 1193–1202 (2000)
Shah, D., Gupta, P.: Fast updating Algorithms for TCAMs. IEEE Micro Mag. 21(1), 36–47 (2001)
Merit Networks, Inc. Internet Performance Measurement and Analysis (IPMA) Statistics and Daily Reports, See http://www.merit.edu/ipma/routing_table/
NLANR Project, See http://moat.nlanr.net/
Rekhter, Y., Li, T.: An Architecture for IP Address Allocation with CIDR. RFC 1518 (September 1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, CT., Wang, PC., Hu, SC., Lee, CL., Chen, RC. (2003). Scalable Packet Classification for IPv6 by Using Limited TCAMs. In: Kahng, HK. (eds) Information Networking. ICOIN 2003. Lecture Notes in Computer Science, vol 2662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45235-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-45235-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40827-7
Online ISBN: 978-3-540-45235-5
eBook Packages: Springer Book Archive