In order to classify packet, we propose a novel IP classification based the non-collision hash and jumping table trie-tree (NHJTTT) algorithm, which is based on noncollision hash Trie-tree and Lakshman and Stiliadis p...In order to classify packet, we propose a novel IP classification based the non-collision hash and jumping table trie-tree (NHJTTT) algorithm, which is based on noncollision hash Trie-tree and Lakshman and Stiliadis proposing a 2-dimensional classification algorithm (LS algorithm). The core of algorithm consists of two parts: structure the non-collision hash function, which is constructed mainly based on destination/source port and protocol type field so that the hash function can avoid space explosion problem; introduce jumping table Trie-tree based LS algorithm in order to reduce time complexity. The test results show that the classification rate of NHJTTT algorithm is up to 1 million packets per second and the maximum memory consumed is 9 MB for 10 000 rules. Key words IP classification - lookup algorithm - trie-tree - non-collision hash - jumping table CLC number TN 393.06 Foundation item: Supported by the Chongqing of Posts and Telecommunications Younger Teacher Fundation (A2003-03).Biography: SHANG Feng-jun (1972-), male, Ph.D. candidate, lecture, research direction: the smart instrument and network.展开更多
主从区块链是一种面向领域的、采用高效密码学原理进行大数据可信化通信及存储的新型信息处理技术.随着领域数据规模的指数级增长,现有主从区块链系统存在的查询效率低、溯源时间长等问题愈发严重.针对这些问题,提出一种面向主从区块链...主从区块链是一种面向领域的、采用高效密码学原理进行大数据可信化通信及存储的新型信息处理技术.随着领域数据规模的指数级增长,现有主从区块链系统存在的查询效率低、溯源时间长等问题愈发严重.针对这些问题,提出一种面向主从区块链的多级索引构建方法(multi-level index construction method for master-slave blockchain,MSMLI).首先,MSMLI引入权重矩阵,基于主链结构将整个主从区块链进行分片,并对各个分片进行权重赋值;其次,针对每个分片内的主区块链,提出基于跳跃一致性哈希的主链索引构建方法(master chain index construction method based on jump consistent Hash,JHMI),输入节点关键值和索引槽位数量,输出主链索引;最后,引入布隆过滤器,改进基于列的选择函数,对各个主区块对应的从属区块链构建2级复合索引.在3种约束条件和2类数据集上的实验结果表明,MSMLI对比现有方法,平均能够缩减9.28%的索引构建时间,提升12.07%的查询效率,同时降低24.4%的内存开销.展开更多
文摘In order to classify packet, we propose a novel IP classification based the non-collision hash and jumping table trie-tree (NHJTTT) algorithm, which is based on noncollision hash Trie-tree and Lakshman and Stiliadis proposing a 2-dimensional classification algorithm (LS algorithm). The core of algorithm consists of two parts: structure the non-collision hash function, which is constructed mainly based on destination/source port and protocol type field so that the hash function can avoid space explosion problem; introduce jumping table Trie-tree based LS algorithm in order to reduce time complexity. The test results show that the classification rate of NHJTTT algorithm is up to 1 million packets per second and the maximum memory consumed is 9 MB for 10 000 rules. Key words IP classification - lookup algorithm - trie-tree - non-collision hash - jumping table CLC number TN 393.06 Foundation item: Supported by the Chongqing of Posts and Telecommunications Younger Teacher Fundation (A2003-03).Biography: SHANG Feng-jun (1972-), male, Ph.D. candidate, lecture, research direction: the smart instrument and network.
文摘主从区块链是一种面向领域的、采用高效密码学原理进行大数据可信化通信及存储的新型信息处理技术.随着领域数据规模的指数级增长,现有主从区块链系统存在的查询效率低、溯源时间长等问题愈发严重.针对这些问题,提出一种面向主从区块链的多级索引构建方法(multi-level index construction method for master-slave blockchain,MSMLI).首先,MSMLI引入权重矩阵,基于主链结构将整个主从区块链进行分片,并对各个分片进行权重赋值;其次,针对每个分片内的主区块链,提出基于跳跃一致性哈希的主链索引构建方法(master chain index construction method based on jump consistent Hash,JHMI),输入节点关键值和索引槽位数量,输出主链索引;最后,引入布隆过滤器,改进基于列的选择函数,对各个主区块对应的从属区块链构建2级复合索引.在3种约束条件和2类数据集上的实验结果表明,MSMLI对比现有方法,平均能够缩减9.28%的索引构建时间,提升12.07%的查询效率,同时降低24.4%的内存开销.
