Browse > Article
http://dx.doi.org/10.7840/KICS.2011.36B.11.1285

A Smart Set-Pruning Trie for Packet Classification  

Min, Seh-Won (이화여자대학교 전자공학과)
Lee, Na-Ra (이화여자대학교 전자공학과)
Lim, Hye-Sook (이화여자대학교 전자공학과)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.36, no.11B, 2011 , pp. 1285-1296 More about this Journal
Abstract
Packet classification is one of the basic and important functions of the Internet routers, and it became more important along with new emerging application programs requiring real-time transmission. Since packet classification should be accomplished in line-speed on each incoming input packet for multiple header fields, it becomes one of the challenges in designing Internet routers. Various packet classification algorithms have been proposed to provide the high-speed packet classification. Hierarchical approach achieves effective packet classification performance by significantly narrowing down the search space whenever a field lookup is completed. However, hierarchical approach involves back-tracking problem. In order to solve the problem, set-pruning trie and grid-of-trie algorithms are proposed. However, the algorithm either causes excessive node duplication or heavy pre-computation. In this paper, we propose a smart set-pruning trie which reduces the number of node duplication in the set-pruning trie by the simple merging of the lower-level tries. Simulation result shows that the proposed trie has the reduced number of copied nodes by 2-8% compared with the set-pruning trie.
Keywords
Smart Set-Pruning; Packet Classification; Hierarchical Trie; Set-Pruning Trie; Scalability;
Citations & Related Records
연도 인용수 순위
  • Reference
1 H. Ionathan Chao, "Next Generation Routers," Predeedings of the IEEE IPROC.2002.802001, Vol.90, Issue 9, pp.1518-1588, Sep., 2002.
2 M. de Berg, M. Van Kreveld, M. Ovennars, and O. Schwarzkopf, "Computational Geometry: Algorithms and Applications," Springer-Verlag, 2000 .
3 Hyesook Lim and Iu Hyoung Mun, "High-Speed Packet Classification Using Binary Search on Length," IEEE/ACM ANCS 2007, Orlando, Florida, Dec. 3-4, 2007.
4 G. Vaghese, "Network Algorithmics", Morgan Kaufmann, 2005.
5 V. Srinivasan, G. Varghese, S. Suri, M. Waldvogel "Fast and Scalable Layer Four Switching," ACM SIGCOMM '98, Vancouver, Sep., 1998.
6 A. Feldman, S. Muthukrishnsn, "Tradeoffs for packet classification," INFOCOM 2000, Vol.3, pp.1193-1202, Mar., 2000.
7 F. Baboescu, S. Singh, G. Varghese, "Packet classification for core router : is there an alternative to CAMs?" IEEE INFOCOM 2003, Vol.1, pp.53-63, Mar., 2003.
8 D. E. Taylor, J. S. Turner, "ClassBench: a packet classification benchmark," Proc.IEEE INFOCOM 2005, pp.2068 - 2079, Mar., 2005.
9 D. E. Taylor, J. S. Turner, The Source Code of Packet Classifiation Bench, http://www.arl.wustl.edu/-det3/ClassBench.index.htm
10 H. Lim, H. Kim, and C. Yim, "IP Address Lookup for Internet Routers Using Balanced Binary Search with Prefix Vector," IEEE Trans. on Communications, Vol.57, No.3, pp.618-621, Mar., 2009   DOI   ScienceOn
11 M. A. Ruiz-Sanchez, E. W. Biersack, W. Dabbous, "Survey and taxonomy of JP address lookup algorithms," IEEE Communications Society, Vol.15 , Issue: 2, pp.8-23, Mar./Apr., 2001