Routing algorithm based on distance-weighted 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.