A hierarchical hashing scheme to accelerate longest prefix matching

机译：一种分层的哈希方案，以加速最长的前缀匹配

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

Longest Prefix Matching in IP Address lookup remains a bottleneck for high-speed routers where large volumes of traffic at multi-gigabyte link speeds require extremely fast lookup time. By taking advantage of bitmap and hashing techniques effectively used in Tree Bitmap algorithm and Binary hash searching on prefix length algorithm we propose a hierarchical hashing scheme based on observations about prefix length distribution in real routing tables. Theoretical analysis and experiments using real routing tables show that our scheme significantly improve IP lookup efficiency by remarkably reducing the number of memory access, consuming less memory and enabling fast update.

机译：IP地址查找中最长的前缀匹配仍然是高速路由器的瓶颈，在高速路由器中，数千兆字节链接速度下的大量流量需要非常快的查找时间。通过利用树位图算法和前缀长度上的二进制哈希搜索中有效使用的位图和哈希技术，我们基于对实际路由表中前缀长度分布的观察，提出了一种分层哈希方案。使用实际路由表的理论分析和实验表明，我们的方案通过显着减少内存访问次数，消耗更少的内存并实现快速更新，显着提高了IP查找效率。

著录项

来源
《IEEE Global Communications Conference》|2014年|1296-1302|共7页
会议地点
作者
Hai Sun; Yan Sun; Valgenti Victor C.; Min Sik Kim;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类
关键词
cryptography; telecommunication network routing; telecommunication traffic; IP address lookup; binary hash searching; hierarchical hashing scheme; high-speed routers; longest prefix matching; lookup time; memory access; multigigabyte link speeds; tree bitmap algorithm; Algorithm design and analysis; Arrays; IP networks; Memory management; Quality of service; Reliability; Routing;

机译：密码学;电信网络路由;电信流量; IP地址查找;二进制哈希搜索;分层哈希方案;高速路由器;最长前缀匹配;查找时间;内存访问;千兆字节链接速度;树位图算法;算法设计和分析;数组IP网络内存管理服务质量可靠性路由;

相似文献

外文文献
中文文献
专利

1. A Hierarchical Hashing Scheme for Nearest Neighbor Search and Broad-Phase Collision Detection [J] . Mickael Pouchol, Alexandre Ahmad, Benoit Crespin, Journal of graphics tools . 2009,第2期

机译：最近邻居搜索和广域碰撞检测的分层哈希方案
2. HCoP-B: A Hierarchical Care-of Prefix With BUT Scheme for Nested Mobile Networks [J] . Chang I.-C., Chou C.-H. Vehicular Technology, IEEE Transactions on . 2009,第6期

机译：HCoP-B：具有嵌套移动网络的BUT方案的分层转交前缀
3. Hierarchical and hash based naming with Compact Trie name management scheme for Vehicular Content Centric Networks [J] . Souk Safdar Hussain, Ahmed Syed Hassan, Kim Dongkyun Computer Communications . 2015,第NOVa1期

机译：面向车载内容中心网络的带有Compact Trie名称管理方案的基于层次和哈希的命名
4. A hierarchical hashing scheme to accelerate longest prefix matching [C] . Hai Sun, Yan Sun, Valgenti Victor C., IEEE Global Communications Conference . 2014

机译：加速最长前缀匹配的分层散列方案
5. Application of Locality Sensitive Hashing to Feature Matching and Loop Closure Detection. [D] . Shahbazi, Hossein. 2012

机译：局部敏感哈希在特征匹配和闭环检测中的应用。
6. Weighted-Attribute Triplet Hashing for Large-Scale Similar Judicial Case Matching [O] . Jiamin Li, Xingbo Liu, Xiushan Nie, 2021

机译：大规模类似司法案例匹配的加权属性三态散列
7. Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems [O] . Sebastian Kniesburges, Christian Scheideler 2014

机译：Hashed patricia Trie：对等系统中的高效最长前缀匹配

A hierarchical hashing scheme to accelerate longest prefix matching

摘要

著录项

相似文献

相关主题

期刊订阅