期刊文献+

基于定位代码和多分支Trie的快速多维数据包分类

A Rapid Multi-Dimensional Packet Classification Based on Location Code and Multi-Branch Trie
下载PDF
导出
摘要 通过对前缀过滤器特点的分析和观察,依据定位代码结合空间分解技术,设计了基于四分支trie的快速多维数据包分类算法,将数据包和过滤器的匹配通过多维空间中点的定位过程来实现,具有较好的时间和空间复杂度,便于硬件实现。 Through the analysis and reviews of prefix router's properties, this paper sets forth a new rapid multi-dimensional packet classification algorism based on four-branch Trie with the help of location code technology and space decomposition, which makes the match of packets and filters possible via the dot location in multi- dimensional space. This algorithm has better time and space complicity and is easy for the hardware to work.
出处 《苏州科技学院学报(自然科学版)》 CAS 2006年第2期65-68,72,共5页 Journal of Suzhou University of Science and Technology (Natural Science Edition)
基金 苏州科技学院院科研基金(030440601)
关键词 数据包分类 定位代码 TRIE 空间分解 packet classification location code Trie space decomposition
  • 相关文献

参考文献6

  • 1Buddhikot M. Space Decomposition Techniques for Fast Layer-4 Swiching[C]. Proceedings of the IFIP Sixth International Workshop on Protocals for High Speed Networks, 1999.
  • 2Tzeng, Henry Hong-Yi, Przygienda T. One fast address-lookup algorithm[J]. IEEE Journal on Selected Areas in Communications, 1999, 17(6):1067-1082.
  • 3Gupta P,Mekeown N. Dynamic Algorithms with Worst-case Performance for Packet Classification [EB/OL]. http://www.microsoft.com,2002-7.
  • 4Waldvogel M. Fast Longest Prefix Matching: Algorithms,Analysis and Applications [D]. Dept of Electrical Eng,ETH Zurich, 2002-7.
  • 5华泽.HOT和BOT研究及改进[J].江南大学学报(自然科学版),2004,3(6):591-594. 被引量:2
  • 6DegerMark M, Brodnik A ,Carlsson S,et al. Small forwarding tables for fast muting lookups[J]. Computer Communication Review, 1997, 27(4):3-14.

二级参考文献5

  • 1[1]WALDVOGEL M. Fast Longest Prefix Matching: Algorithms, Analysis, and Applications[D]. Department of Electrical Engineering, ETH. Zurich, 2002.
  • 2[2]MKEON. Dynamic Algorithms with Worst- case Performance for Packet Classification[EB/OL]. http://www.microsoft.com, 2002 -07 -06.
  • 3[3]BUDDHIKOT M, SURI S, WALDVOGEL M. Space Decomposition Techniques for Fast Layer-4 Switching[A].Proceedings of the IFIP Sixth International Workshop on Protocols for High Speed Networks,New York, 1999.
  • 4[4]GUPTAP, LINS. Routing lookups in hardware at memory access speeds[A]. IEEE INFOCOM[C]. SanFrancisco:Prentice Hall, 1998. 1240- 1247.
  • 5邵华钢,杨明福.基于空间分解技术的多维数据包分类[J].计算机工程,2003,29(12):123-124. 被引量:1

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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