IPv6查询数据结构 [英] IPv6 lookup data structure
问题描述
一个爱好者特技是知名的,推荐数据结构用于存储IPv4分配/分配并执行查找。
这是否适用于IPv6 adddresses?只需一个更深/更高的特技来容纳额外的96位?你是否仍然使用Patricia尝试的更深层次,但是,问题是性能随着特里深度线性下降。
设计用于IPv6查找的专用数据结构是一个活动字段。最近的出版物包括:
- 用于IPv6查询的动态二进制哈希方案(PDF)
- 一个href =http://www.arl.wustl.edu/~hs1/publication/iplookup2.pdf =nofollow>使用分布式和负载平衡布隆过滤器对100Gbps核心路由器线卡进行IPv6查找 (PDF)
- FlashTrie:哈希基于IP的路由查找超过100Gbps的预制压缩技术(PDF)
我不知道有什么可用(开源)实现这些数据结构。
A patricia trie is the well-know, recommended data structure for storing IPv4 allocations/assignments and performing lookup.
Is this true for IPv6 adddresses too? Just a deeper/taller trie to accommodate the extra 96 bits? Is the trie still patricia, or a different radix trie?
You can still use Patricia tries with a bigger depth, but the problem is the performance degrades linearly with the trie depth. Designing specialized data structures for IPv6 lookup is an active field. Recent publications include:
- A Dynamic Binary Hash Scheme for IPv6 Lookup (PDF)
- IPv6 Lookups using Distributed and Load Balanced Bloom Filters for 100Gbps Core Router Line Cards (PDF)
- FlashTrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps (PDF)
I don't know of any available (open source) implementations of these data structures.
这篇关于IPv6查询数据结构的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!