基于Bloom Filter的虚拟路由合并与查找算法的研究
首发时间:2014-12-26
摘要:当前,随着网络虚拟化的发展,对虚拟路由器的研究也成为热点。通常有多个虚拟路由器部署在一台物理路由器上,导致路由表的增加,如何实现路由的高效查找成为虚拟路由器研究领域的热点问题。本文通过使用Trie树合并和Bloom Filter来实现路由的快速查找。首先,根据路由表生成Trie树,对Trie树进行Leaf-pushing后将多个Trie树合并,之后为合并后的Trie树每一层构建一个布隆过滤器存储在片内存储器如TCAM中,将对应的前缀与下一跳映射的Hash表存在片外存储器中。因片内存储器的存取速度远远大于片外存储器,通过增加额外布隆过滤器和对每层Bloom Filter哈希函数个数的调整,减小Bloom Filter假阳性,减少多次片外访存的次数,提高算法性能。
关键词: 计算机网络 虚拟路由器 路由查找 Trie树 Bloom Filter
For information in English, please click here
Research of virtual ip-address merging and lookup based on bloom filters
Abstract:At present,virtual routers have become a hot topic with the developping of network virtualization.There are plenty of virtual router instances in a physic router,each with its own FIB(Forwding Information Base).How to achieve high forwarding performance is a challenge.In this paper,we combine trie-merging and prefix bloom filter to conduct IP lookup.We first merge all the prefixes from FIBs on the leaf-pushing trie.Then we bulid a bloom filter and a hash table for the prefixes at each level of the merged trie. As the access of on-chip memory such as TCAM is tens of times of that of off-chip memory,we add an extra bloom filter and adust each level's bloom filter to reduce the false positive of the bloom filter and the access of off-chip memory.
Keywords: computer network virtual router route lookup trie bloom filter
基金:
论文图表:
引用
No.4623859102534714****
同行评议
共计0人参与
勘误表
基于Bloom Filter的虚拟路由合并与查找算法的研究
评论
全部评论0/1000