We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 17 Issue 2
March  2002
Turn off MathJax
Article Contents
Abstract
Related Articles
XU Ke, WU Jianping, YU Zhongchao, XU Mingwei. A Non-Collision Hash Trie-Tree Based Fast IP Classification Algorithm[J]. Journal of Computer Science and Technology, 2002, 17(2).
Citation: XU Ke, WU Jianping, YU Zhongchao, XU Mingwei. A Non-Collision Hash Trie-Tree Based Fast IP Classification Algorithm[J]. Journal of Computer Science and Technology, 2002, 17(2).
shu

A Non-Collision Hash Trie-Tree Based Fast IP Classification Algorithm

More Information
  • Published Date: March 14, 2002
    Abstract
  • With the development of networkapplications, routers must support such functions as firewalls,provision of QoS, traffic billing, etc. All these functions need theclassification of IP packets, according to how different thepackets are processed subsequently, which is determined. In this article, anovel IP classification algorithm is proposed based on the Grid of Triesalgorithm. The new algorithm not only eliminates original limitationsin the case of multiple fields but also shows better performance inregard to both time and space. It has better overall performance thanmany other algorithms.
    • FullText(HTML)
    • References (0)
    • Relative Articles

  • Related Articles

    [1]Shu-Sheng Liu, Zheng Gong, Li-Bin Wang. Cryptanalysis of Reduced-Round DASH[J]. Journal of Computer Science and Technology, 2013, 28(1): 159-164. DOI: 10.1007/s11390-013-1320-x
    [2]Jie Liang, Xue-Jia Lai. Improved Collision Attack on Hash Function MD5[J]. Journal of Computer Science and Technology, 2007, 22(1): 79-87.
    [3]GAO Suixiang, LIN Guohui. Decision Tree Complexity of Graph Properties with Dimension at Most5[J]. Journal of Computer Science and Technology, 2000, 15(5): 416-422.
    [4]WAN Yingyu, XU Yinlong, GU Xiaodong, CHEN Guoliang. Efficient Minimum Spanning Tree Algorithms on the Reconfigurable Mesh[J]. Journal of Computer Science and Technology, 2000, 15(2): 116-125.
    [5]MA Jun, YANG Bo, MA Shaohan. A Practical Algorithm for the Minimum Rectilinear Steiner Tree[J]. Journal of Computer Science and Technology, 2000, 15(1): 96-99.
    [6]Chung-Han CHEN. Embedding Binary Tree in VLSI/WSI Processor Array[J]. Journal of Computer Science and Technology, 1996, 11(3): 326-336.
    [7]Xu Meirui, Liu Xiaolin. A VLSI Algorithm for Calculating the Tree to Tree Distance[J]. Journal of Computer Science and Technology, 1993, 8(1): 68-76.
    [8]Fan Zhongchun, Xing Hancheng. DKLFRS:A Default Knowledge Logical Framework Representation System[J]. Journal of Computer Science and Technology, 1992, 7(2): 136-142.
    [9]Li Hao, Liu Qun. A Problem of Tree Graph[J]. Journal of Computer Science and Technology, 1989, 4(1): 61-66.
    [10]Meng Liming, Xu Xiaofei, Chang Huiyou, Chen Guangxi, Hu Mingzeng, Li Sheng. A Tree-Structured Database Machine for Large Relational Database Systems[J]. Journal of Computer Science and Technology, 1987, 2(4): 265-275.
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (12) PDF downloads (6) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return