Research on stochastic matrix mapping Hash for specific flow matching

TANG Hong; WU Yong-jun; ZHAO Guo-feng

您当前的位置：

首页 >

文章列表页 >

Research on stochastic matrix mapping Hash for specific flow matching

更新时间：2024-10-14

- Research on stochastic matrix mapping Hash for specific flow matching
- Issue 2, Pages: 17-22(2007)
- 作者机构：
  
  1. 重庆邮电大学
  2. 重庆邮电大学,重庆,400065
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP393.02
- Published：2007
- 稿件说明：
移动端阅览
TANG Hong, WU Yong-jun, ZHAO Guo-feng. Research on stochastic matrix mapping Hash for specific flow matching[J]. 2007, (2): 17-22.
DOI：

TANG Hong, WU Yong-jun, ZHAO Guo-feng. Research on stochastic matrix mapping Hash for specific flow matching[J]. 2007, (2): 17-22. DOI：

摘要

针对常规的Hash算法用于流匹配时冲突率高且不可控制的缺点

提出了一种随机矩阵映射Hash算法。该算法通过预先优选一个随机数矩阵

然后将大集合的元素分块映射成随机矩阵中的元素

从而把一个大集合映射到一个小集合。测试结果表明

该算法运算速度快、空间利用率高、冲突率低

用于流匹配时匹配速度可以达到2Mpacket/s

支持规则数达5万条以上。

Abstract

Because a general Hash algorithm had high collision rate and was not controlled while be used to flow match-ing

a stochastic matrix mapping Hash algorithm was presented

in which the elements of a large set were mapped into a small set through a pre-choosing stochastic number matrix.Tests show that the algorithm has high operation speed

high storage utilization rate and low collision rate

its flow matching speed is up to 2 million packets per second and it supports 50000 matching rules.

关键词

Keywords

references

Views

753

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Traffic measurement algorithm based on least recent used and Bloom filter

Related Author

Zhen ZHANG

Bin-qiang WANG

Feng-yu ZHANG

Ning-ning LIANG

Related Institution

National Digital Switching System Engineering ＆ Technological R＆D Center

AI问答

⁰