Browse > Article
http://dx.doi.org/10.7840/KICS.2012.37B.4.245

Two-Dimensional Binary Search on Length Using Bloom Filter for Packet Classification  

Choe, Young-Ju (이화여자대학교정보통신학과 SoC Design 연구실)
Lim, Hye-Sook (이화여자대학교정보통신학과 SoC Design 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.37, no.4B, 2012 , pp. 245-257 More about this Journal
Abstract
As one of the most challenging tasks in designing the Internet routers, packet classification is required to achieve the wire-speed processing for every incoming packet. Packet classification algorithm which applies binary search on trie levels to the area-based quad-trie is an efficient algorithm. However, it has a problem of unnecessary access to a hash table, even when there is no node in the corresponding level of the trie. In order to avoid the unnecessary off-chip memory access, we proposed an algorithm using Bloom filters along with the binary search on levels to multiple disjoint tries. For ACL, FW, IPC sets with about 1000, 5000, and 10000 rules, performance evaluation result shows that the search performance is improved by 21 to 33 percent by adding Bloom filters.
Keywords
Packet classification; Bloom filter; binary search on trie levels; best matching rule;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Soyeon Kim and Hyesook Lim, "Tuple Pruning Using Bloom Filters for Packet Classification," ITC-CSCC 2009.
2 Raj Jain, "Comparison of Hashing Schemes for Address Lookup in Computer Networks," in IEEE Transactions on Communications, vol.40, no.10, pp.1570-1573, 1992.   DOI   ScienceOn
3 D. E. Taylor and J. S. Turner, "Classbench: A packet classification benchmark," in IEEE INFOCOM, 2005.
4 D. E.Taylor, J. S. Turner. The Source Code of Packet Classification Bench, http://www.arl.wustl.edu/-det3/ClassBench.index.htm
5 H. Jonathan Chao, "Next Generation Routers, " Proceedings of the IEEE, vol. 90, Iss. 9, pp.1518-1588, Sept. 2002.   DOI   ScienceOn
6 Hyesook Lim and Ju Hyoung Mun, "High-Speed Packet Classification Using Binary Search on Length," IEEE/ACM ANCS, 2007.
7 M. de Berg, M. Van Kreveld, M.Overmars, and O. Schwarzkopf, "Computational Geometry: Algorithms and Applications," Springer-Verlag, 2000.
8 M. M. Buddhikot, S. Suri, and M.Waldvogel, "Space decomposition techniques for fast layer-4switching," in Proc. Conf. Protocols for High Speed Networks, pp.25-41 Aug.1999.
9 M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable high speed IP routing lookups," Proc. ACM SIGCOMM, pp.25-35, 1997.
10 P. Gupta and N. Mckeown, "Algorithm for packet classification," IEEE Network, vol.15, no.2, pp.24-32, Mar./Apr. 2001.
11 S. Dharmapurikar, H. Song, J. Turner, J. Lockwood,"Fast Packet Classification Using Bloom filters," in ANCS, 2006.
12 Hyesook Lim, Min Young Kang, and Changhoon Yim, "Two-dimensional packet classification algorithm using a quad-tree," Computer Communications, Elsevier Science, vol.30, no.6, pp.1396-1405, Mar. 2007.   DOI   ScienceOn
13 Andrei Broder and Michael Mitzenmacher, "Network Applications of Bloom filters: A Survey," Internet Mathematics, vol.I, no.4, pp.485-509, May, 2004.