The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - May/June (2010 vol.30)
pp: 48-59
Hyesook Lim , Ewha Womans University, Seoul
So Yeon Kim , Ewha Womans University, Seoul
ABSTRACT
<p>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 authors propose a tuple-pruning algorithm that reduces the search space through Bloom filter queries, which do not require off-chip memory accesses.</p>
INDEX TERMS
packet classification, tuple space search, tuple pruning, Bloom filter, hardware
CITATION
Hyesook Lim, So Yeon Kim, "Tuple Pruning Using Bloom Filters for Packet Classification", IEEE Micro, vol.30, no. 3, pp. 48-59, May/June 2010, doi:10.1109/MM.2010.44
REFERENCES
1. H.J. Chao, "Next Generation Routers," Proc. IEEE, vol. 90, no. 9, 2002, pp. 1518-1588.
2. H. Yu and R. Mahapatra, "A Memory-Efficient Hashing by Multi-Predicate Bloom Filters for Packet Classification," Proc. IEEE Int'l Conf. Computer Comm. (INFOCOM), IEEE Press, 2008, pp. 2467-2475.
3. V. Srinivasan, S. Suri, and G. Varghese, "Packet Classification Using Tuple Space Search," Proc. ACM SIGCOMM, ACM Press, 1999, pp.135-146.
4. V. Srinivasan et al., "Fast and Scalable Layer Four Switching," Proc. ACM SIGCOMM, ACM Press, 1998, pp. 191-202.
5. H. Song, J. Turner, and S. Dharmapurikar, "Packet Classification Using Coarse-Grained Tuple Spaces," Proc. Architecture for Networking and Comm. Systems (ANCS), ACM Press, 2006, pp. 41-50.
6. S. Dharmapurikar et al., "Fast Packet Classification Using Bloom Filters," Proc. Architecture for Networking and Comm. Systems (ANCS), ACM Press, 2006, pp. 61-70.
7. S. Dharmapurikar, P. Krishnamurthy, and D. Taylor, "Longest Prefix Matching Using Bloom Filters," IEEE/ACM Trans. Networking, vol. 14, no. 2, 2006, pp. 397-409.
8. H. Song et al., "Fast Hash Table Lookup Using Extended Bloom Filter: An Aid of Network Processing," Proc. ACM SIGCOMM, 2005, pp. 181-192.
9. C. Martinez, D. Pandya, and W. Lin, "On Designing Fast Non-uniformly Distributed IP Address Lookup Hashing Algorithms," IEEE/ACM Trans. Networking, vol. 17, no. 6, 2009, pp.1916-1925.
10. F. Yu and T.V. Lakshnam, "Efficient Multimatch Packet Classification and Lookup with TCAM," IEEE Micro, vol. 25, no. 1, 2005, pp. 50-59.
11. D.E. Taylor, J.S. Turner, "ClassBench: A Packet Classification Benchmark," IEEE/ACM Trans. Networking, vol. 15, no. 3, 2007, pp. 499-511.
12. H. Lim, M. Kang, and C. Yim, "Two-dimensional Packet Classification Algorithm Using a Quad-tree," Computer Comm., vol. 30, no. 6, 2007, pp. 1396-1405.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool