The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지
DOI QR코드

DOI QR Code

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

블룸 필터를 사용한 길이에 대한 2차원 이진검색 패킷 분류 알고리즘

  • 최영주 (이화여자대학교정보통신학과 SoC Design 연구실) ;
  • 임혜숙 (이화여자대학교정보통신학과 SoC Design 연구실)
  • Received : 2012.01.10
  • Accepted : 2012.04.17
  • Published : 2012.04.30
Download PDF
⟨ Previous Next ⟩

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.

패킷 분류는 인터넷 라우터가 수행하는 가장 중요한 기능 중 하나로써 들어오는 모든 패킷을 선 속도로 처리하기를 요구한다. 영역분할을 사용한 사분트라이 구조에 길이 별 이진 검색을 적용한 알고리즘은 2차원 필드를 동시에 검색하면서 검색영역을 반으로 줄여나갈 수 있으므로 매우 효율적인 구조이다. 하지만 트라이의 레벨에 노드가 없는 경우에도 해시 테이블에 접근하는 문제점이 존재한다. 따라서 본 논문에서는 해시 메모리로의 불필요한 접근을 줄이기 위해서 영역분할을 사용한 사분 트라이의 길이별 이진 검색에 블룸 필터를 적용하는 패킷분류 구조를 제안한다. 현재 사용되는 ACL, FW, IPC 룰 타입의 1000, 5000, 10000개의 룰 셋으로 실험한 결과, 블룸 필터를 적용함으로써 검색 성능이 21~33%까지 향상되는 결과를 얻었다.

Keywords

References

  1. H. Jonathan Chao, "Next Generation Routers, " Proceedings of the IEEE, vol. 90, Iss. 9, pp.1518-1588, Sept. 2002. https://doi.org/10.1109/JPROC.2002.802001
  2. M. de Berg, M. Van Kreveld, M.Overmars, and O. Schwarzkopf, "Computational Geometry: Algorithms and Applications," Springer-Verlag, 2000.
  3. 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.
  4. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable high speed IP routing lookups," Proc. ACM SIGCOMM, pp.25-35, 1997.
  5. Hyesook Lim and Ju Hyoung Mun, "High-Speed Packet Classification Using Binary Search on Length," IEEE/ACM ANCS, 2007.
  6. P. Gupta and N. Mckeown, "Algorithm for packet classification," IEEE Network, vol.15, no.2, pp.24-32, Mar./Apr. 2001.
  7. S. Dharmapurikar, H. Song, J. Turner, J. Lockwood,"Fast Packet Classification Using Bloom filters," in ANCS, 2006.
  8. 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. https://doi.org/10.1016/j.comcom.2007.01.004
  9. Andrei Broder and Michael Mitzenmacher, "Network Applications of Bloom filters: A Survey," Internet Mathematics, vol.I, no.4, pp.485-509, May, 2004.
  10. Soyeon Kim and Hyesook Lim, "Tuple Pruning Using Bloom Filters for Packet Classification," ITC-CSCC 2009.
  11. 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. https://doi.org/10.1109/26.168785
  12. D. E. Taylor and J. S. Turner, "Classbench: A packet classification benchmark," in IEEE INFOCOM, 2005.
  13. D. E.Taylor, J. S. Turner. The Source Code of Packet Classification Bench, http://www.arl.wustl.edu/-det3/ClassBench.index.htm