期刊文献+

用于快速流分类的关键字分解Hash算法 被引量:4

Keywords Decompound Hash Algorithm for Quick Flow Classification
下载PDF
导出
摘要 在Hash算法的基础上,提出一种基于关键字分解的快速流分类算法。通过把关键字进行分解,与预先选定的随机质数向量进行异或后相乘得出Hash值。实验结果表明,与IPSX、CRC32和Bob-Jenkins Hash算法相比,该算法在哈希值的计算速率、值的分布均匀性和冲突率等方面具有较好的性质,分类速度达到18 Mp/s,能满足快速网络流量测量的需求。 This paper proposes a keywords decompound Hash algorithm for quick flow classification based on keywords decompound.It receives the key by decompounding the keywords to small blocks,xored with selected primes and multiplied.Compared D-hash with IPSX,CRC32 and Bob Jenkins Hash algorithms.Experimental results indicate that the algorithm has good capability in rate,well-proportioned keys and collision rate.The classification rate is 18 Mp/s,D-hash can satisfy the quick net flow measurement.
作者 赵国峰 闫亮
出处 《计算机工程》 CAS CSCD 北大核心 2010年第16期79-81,共3页 Computer Engineering
基金 教育部科学技术研究基金资助重点项目(208117) 重庆市教委应用基础研究基金资助项目(KJ080528)
关键词 流分类 HASH算法 关键字分解 flow classification Hash algorithm keywords decompound
  • 相关文献

参考文献8

  • 1彭芸,刘琼.Internet流分类方法的比较研究[J].计算机科学,2007,34(8):58-61. 被引量:17
  • 2Brownlee N.Traffic Flow Measurement Experiences with NeTraMet[S].RFC 2123,1997.
  • 3Cao Z,Wang Z,Zegura E.Performance of Hashing-based Schemes for Internet Load Balancing[C] //Proc.of INFOCOM'00.Piscataway,NJ,USA:IEEE Computer and Communications Societies,2000.
  • 4程光,龚俭,丁伟,徐加羚.面向IP流测量的哈希算法研究[J].软件学报,2005,16(5):652-658. 被引量:54
  • 5PREISS B R.数据结构与算法-面向对象的C++设计模式[M].胡广斌,王崧,惠民,等译北京:电子工业出版社2000.
  • 6Zseby T,Molina M,Raspall F,et al.Sampling and Filtering Techniques for IP Packet Selection[EB/OL].(2004-10-03).http:// tools.ietf.org/html/draft-ietf-psamp-sample-tech-05#section-17.
  • 7Jenkins B.Algorithm Alley[J/OL].(1997-09-10).Dr.Dobb's Journal,http:// burtleburtle.net/bob/hash/doobs.html.
  • 8强士卿,程光.基于流的哈希函数比较分析研究[J].南京师范大学学报(工程技术版),2008,8(4):25-28. 被引量:7

二级参考文献27

  • 1[1]Molina M,Niecolini S,Duffield N G.A comparative experimental study of hash functions applied to packet sampling[C]//International Teletraffic Congress(ITC-19).Beijing:2005.
  • 2[2]Molina M,Tartarelli S,Raspallm F,et al.Implementation of an IPFIX compliant flow traffic meter:challenges and performance assessment[C]// IEEE Workshop on IP Operations and Management,2003:61 -67.
  • 3[4]Whang K,Vander Zanden B,Taylor H.A Linear-time probabilistic counting algorithm for database applications[J].ACM Trans on Database Systems,1990,15(2):208 -229.
  • 4[5]Zseby T,Molina M,Raspall F,et al.Sampling and filtering techniques for IP packet selection[EB/OL].IETF 2004:32 -33.http://tools.ietf.org/html/draft-ietf-psamp-sample -tech -05#section-17.
  • 5[6]Jenkins B.Algorithm Alley,Dr.Dobb' s Journal,September 1997[J/OL].http://burtleburtle.net/bob/hash/doobs,html.
  • 6IP Flow information export (ipfix). 2004. http://www.ietf. org/html.charters/ipfix-charter.html
  • 7Thompson K, Miller G, Wilder R. Wide area Internet traffic patterns and characteristics. IEEE Network, 1997,11(6):10-23.
  • 8Cisco Netflow. 2004. http://www.cisco.com/warp/public/732/Tech/nmp/netflow/index.shtml
  • 9Jain R. A comparison of hashing schemes for address lookup in computer networks. IEEE Trans. on Communications, 1992,40(3):1570-1573.
  • 10Cao Z, Wang Z, Zegura E. Performance of hashing-based schemes for Internet load balancing. In: Nokia FB, ed. Proc. of the IEEE INFOCOM 2000. Piscataway: IEEE Computer and Communications Societies, 2000. 332-341.

共引文献73

同被引文献21

  • 1刘丹,赵有健.基于Trie树分割路由表降低TCAM功耗的方法[J].计算机工程,2007,33(11):100-102. 被引量:2
  • 2Ruiz-Sanchez M A,Biersack E W,Dabbous W.Survey and Taxonomy of IP Address Lookup Algorithms[J].IEEE Network,2001,15(2):8-23.
  • 3Kim Nam-Soo,Kim Young-Sang.Comparative Studies of Address Lookup Algorithms for IPv6[C]//Proc.of ICACT’06.Hong Kong,China:[s.n.],2006:285-290.
  • 4Gamache B,Pfeffer Z,Khatri S P.A Fast Ternary CAM Design for IP Networking Applications[C]//Proc.of the 12th International Conference on Computer Communications and Networks.Dallas,USA:[s.n.],2003:434-439.
  • 5Erdem O,Bazlama X E,Bazlama·i C F.Array Design for Trie-based IP Lookup[J].Communications Letters,2010,14(8):773-775.
  • 6Zheng Kai,Liu Zhen,Liu Bin.A Scalable IPv6 Route Lookup Scheme via Dynamic Variable-stride Bitmap Compression and Path Compression[J].Computer Communications,2006,29(16):3037-3050.
  • 7Chu Yuansun,Su Huikai,Lin Pofeng,et al.IC Design of IPv6 Routing Lookup for High Speed Networks[C]//Proc.of the 6th International Conference on Computational Science.New York,USA:[s.n.],2006:1832-1835.
  • 8Li Zhenqiang,Deng Xiaohong,Ma Hongxiao,et al.Divide and Conquer:A Scheme for IPv6 Address Longest Prefix Matching[C]//Proc.of Workshop on High Performance Switching and Routing.Hong Kong,China:[s.n.],2006:37-42.
  • 9Gamache B,Pfeffer Z,Khatri S P.A Fast Ternary CAM Design for IP Networking Applications[C]//Proc.of the 12th International Conference on Computer Communications and Networks.Dallas,USA:[s. n. ],2003:434-439.
  • 10Table Data[EB/OL].(2011-05-15).http://bgp.potaroo.net.

引证文献4

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部