基于距离加权Bloom filter的网络路由算法

Routing algorithm based on distance-weighted Bloom filter

基于分布式哈希表(DHT)的P2P查找经常受到在底层网络中路由时无必要的路径长度增加的影响.另外,DHT在处理复制方面也有一定的缺陷.文中探讨了解决这些问题的方法.对使用Bloom filters作为资源路由的方法做了简要回顾,并较为详细地阐述了在资源分散的覆盖网络中使用距离加权Bloom filter的网络路由算法.对该算法进行了仿真测试,证明了其有效性.

The DHT-based P2P lookup always suffers from unnecessarily long routers in the underlay network though it is very popular in the research community. Another problem with DHT is its ineffectiveness in replica-handling. In order to solve the above problems, the method to use Bloom filters as the resource routing was briefly introduced, and the distance-weighted Bloom filters （dwBFs） as a concise representation of routing information for scattered resources in overlay networks was detailedly explained, and a routing algorithm based on the dwBFs was also described. Meanwhile a simulation experiment was given to show its effectiveness.