首页> 外文期刊>计算机科学技术学报(英文版) >A Non-Collision Hash Trie-Tree Based FastIP Classification Algorithm
【24h】

A Non-Collision Hash Trie-Tree Based FastIP Classification Algorithm

机译:基于非冲突哈希树的FastIP分类算法

获取原文
获取原文并翻译 | 示例
       

摘要

With the development of network applications, routers must support such functions as firewalls, provision of QoS, traffic billing, etc. All these functions need the classification of IP packets, according to how different the packets are processed subsequently, which is determined. In this article, a novel IP classification algorithm is proposed based on the Grid of Tries algorithm. The new algorithm not only eliminates original limitations in the case of multiple fields but also shows better performance in regard to both time and space. It has better overall performance than many other algorithms.
机译:随着网络应用程序的开发,路由器必须支持这样的功能,作为防火墙,提供QoS,交通计费等。所有这些功能都需要分类IP数据包,根据数据包随后处理的不同,这是确定的。在本文中,基于尝试算法的网格提出了一种新颖的IP分类算法。新算法不仅消除了多个字段的情况下的原始限制,而且还显示了在时间和空间方面的更好性能。它具有比许多其他算法更好的整体性能。

著录项

  • 来源
    《计算机科学技术学报(英文版)》 |2002年第2期|219-226|共8页
  • 作者单位

    Department of Computer Science and Technology, Tsinghua University Beijing 100084, P.R. China;

    Department of Computer Science and Technology, Tsinghua University Beijing 100084, P.R. China;

    Department of Computer Science and Technology, Tsinghua University Beijing 100084, P.R. China;

    Department of Computer Science and Technology, Tsinghua University Beijing 100084, P.R. China;

  • 收录信息 中国科学引文数据库(CSCD);
  • 原文格式 PDF
  • 正文语种 chi
  • 中图分类 计算技术、计算机技术;
  • 关键词

    IP classification; hash; Trie-tree;

    机译:IP分类;哈希;Trie树;
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号