首页> 外文会议>International conference on impulsive dynamical systems and applications >Study on a Non-collision Hash IP Classification Algorithm
【24h】

Study on a Non-collision Hash IP Classification Algorithm

机译:非碰撞散列IP分类算法研究

获取原文

摘要

Real time traffic measurement of network is becoming increasingly important for managing and controlling network. Flows-based traffic measurement is one of the methods. How to match the packets with a specific flow is one of key issues in specific flows-based measurement. This paper presents a method for this purpose, namely Non-Collsion Hash and Multibit-trie Tree Classification Algorithm (for short, NCHMTC Algorithm) algorithm, which is based on Non-Collision Hash Trie-Tree Algorithm and Grid of Tries algorithm. The core of algorithm has 3 parts: 1) constructing hash function mainly based on destination/source port and protocol type field so that the hash function can avoid space explosion problem; 2) incorporating two kinds of algorithm, which are the multibit-trie algorithm and the algorithm of Grid of Tries as well as transforming Grid of Tries for the Trie-tree pruned in order to reduce space complexity; 3) incorporating no using mltibit-trie item. Test results show that the classification rate of NCHMTC algorithm is up to 2 million packets per second and the maximum memory consumed is 10MB for 10,000 rules.
机译:对于管理和控制网络,网络的实时交通测量变得越来越重要。流动的流量测量是其中一种方法。如何匹配具有特定流的数据包是基于特定流动的关键问题之一。本文介绍了这一目的的方法,即非Collsion Hash和多位-特里树分类算法(简称NCHMTC算法)算法,它是基于非冲突哈希特里树算法和尝试的网格算法。算法的核心有3个部分:1)构造散列函数主要基于目的地/源端口和协议类型字段,使散列函数可以避免空间爆炸问题; 2)包含两种算法,这是多字节 - TRIE算法和尝试网格算法以及转换TRIES的栅格,以降低空间复杂性; 3)不使用MLtibit-Trie项目。测试结果表明,NCHMTC算法的分类率为每秒高达200万数据包,最大内存为10,000规则为10MB。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号