基于BloomFilter的虚拟路由合并与查找算法的研究.pdf

中国科技论文在线 基于Bloom Filter 的虚拟路由合并与查找算 法的研究 1 2** 梁飞 ，徐明伟 5 （1. 北京邮电大学网络技术研究院,北京 100876； 2. 清华大学计算机系,北京 100083 ） 摘要：当前，随着网络虚拟化的发展，对虚拟路由器的研究也成为热点。通常有多个虚拟路 由器部署在一台物理路由器上，导致路由表的增加，如何实现路由的高效查找成为虚拟路由 10 器研究领域的热点问题。本文通过使用Trie 树合并和Bloom Filter 来实现路由的快速查找。 首先，根据路由表生成Trie 树，对Trie 树进行Leaf-pushing 后将多个Trie 树合并，之后 为合并后的Trie 树每一层构建一个布隆过滤器存储在片内存储器如TCAM 中，将对应的前缀 与下一跳映射的Hash 表存在片外存储器中。因片内存储器的存取速度远远大于片外存储器， 通过增加额外布隆过滤器和对每层Bloom Filter 哈希函数个数的调整，减小Bloom Filter 15 假阳性，减少多次片外访存的次数，提高算法性能。 关键词：计算机网络；虚拟路由器；路由查找；Trie 树；Bloom Filter 中图分类号：TP393.0 Research of virtual ip-address merging and lookup based on 20 bloom filters 1 2 Liang Fei , Xu Mingwei (1. Network Technology Institute,Beijing University of Posts and Telecommunications,Beijing 100876; 2. Computer Science Department,Tsinghua University,Beijing 100083) 25 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 30 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 me