Haoyu Song
Jonathan Turner
ABSTRACT
While the problem of high performance packet classification has received a great deal of attention in recent years, the research community has yet to develop algorithmic methods that can overcome the drawbacks of TCAM-based solutions. This paper introduces a hybrid approach, which partitions the filter set into subsets that are easy to search efficiently. The partitioning strategy groups filters that are close to one another in tuple space [10], which makes it possible to use information from single field lookups to limit the number of subsets that must be searched. We can trade-off running time against space consumption by adjusting the coarseness of the tuple space partition. We find that for two-dimensional filter sets, the method finds the best-matching filter with just four hash probes while limiting the memory space expansion factor to about 2. We also introduce a novel method for Longest Prefix Matching (LPM), which we use as a component of the overall packet classification algorithm. Our LPM method uses a small amount of on-chip memory to speedup the search of an off-chip data structure, but uses significantly less on-chip memory than earlier methods based on Bloom filters.
- F. Baboescu, S. Singh, and G. Varghese. Packet classification for core routers: Is there an alternative to CAMs? In IEEE INFOCOM 2003.Google Scholar
Cross Ref
- M. Buddhikot, S. Suri, and M. Waldvogel. Space Decomposition Techniques for Fast Layer-4 Switching. In Conference on Protocols for High Speed Networks 1999. Google ScholarDigital Library
- E. Cohen and C. Lund. Packet Classification in Large ISPs: Design and Evaluation of Decision Tree Classifiers. In ACM SIGMETRICS/Performance 2005. Google ScholarDigital Library
- S. Dharmapurikar, P. Krishnamurthy, and D. Taylor. Longest Prefix Matching using Bloom Filters. In ACM SIGCOMM Aug. 2003. Google ScholarDigital Library
- W. Eatherton, G. Varghese, and Z. Dittia. Tree Bitmap: hardware/software IP Lookups with Incremental Updates. ACM SIGCOMM Computer Communication Review 2004. Google ScholarDigital Library
- J. Hasan and T. N. Vijaykumar. Dynamic Pipelining: Making IP Lookup Truly Scalable. In ACM SIGCOMM 2005. Google ScholarDigital Library
- R. Sangireddy, N. Futamura, S. Aluru, and A. K. Somani. Scalable, Memory Efficient, High-Speed IP Lookup Algorithms. IEEE/ACM Transactions on Networking 13, Aug. 2005. Google ScholarDigital Library
- H. Song, S. Dharmarpurikar, J. Turner, and J. Lockwood. Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing. In ACM SIGCOMM 2005. Google ScholarDigital Library
- H. Song, J. Turner, and J. Lockwood. Shape Shifting Tries for Faster IP Lookup. In IEEE ICNP 2005. Google ScholarDigital Library
- V. Srinivasan, S. Suri, and G. Varghese. Packet Classification Using Tuple Space Search. In ACM SIGCOMM 1999. Google ScholarDigital Library
- V. Srinivasan and G. Varghese. Fast Address Lookups using Controlled Prefix Expansion. ACM Transaction on Computer Systems 17, Feb. 1999. Google ScholarDigital Library
- V. Srinivasan, G. Varghese, S. Suri, and M. Waldvogel. Fast and Scalable Layer Four Switching. In ACM SIGCOMM 1998. Google ScholarDigital Library
- M. Waldvogel, G. Varghese, J. Turner, and B. Plattner. Scalable High Speed IP Routing Lookups. In ACM SIGCOMM 1997. Google ScholarDigital Library
- P. Warkhede, S. Suri, and G. Varghese. Fast Packet Classification for Two-Dimensional Conflict-Free Filters. In IEEE INFOCOM 2001.Google Scholar
Index Terms
- Packet classification using coarse-grained tuple spaces
Recommendations
Packet classification using tuple space search
SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communicationRouters must perform packet classification at high speeds to efficiently implement functions such as firewalls and QoS routing. Packet classification requires matching each packet against a database of filters (or rules), and forwarding the packet ...
Tuple Pruning Using Bloom Filters for Packet Classification
Tuple pruning for packet classification provides fast search and a low implementation complexity. The tuple pruning algorithm reduces the search space to a subset of tuples determined by individual field lookups that cause off-chip memory accesses. The ...
Packet classification using tuple space search
Routers must perform packet classification at high speeds to efficiently implement functions such as firewalls and QoS routing. Packet classification requires matching each packet against a database of filters (or rules), and forwarding the packet ...
Comments