A Routing Mechanism by Distance-weighted Bloom Filter

Abstract

Bloom filters are used for resource routing and distance-weighted Bloom filters (dwBFs) are used as a concise representation of routing information for scattered resources in overlay networks. Today's DHT-based P2P lookups are always influenced by unnecessarily long routers in the underlay network. The reason is that the false positives appearing in DHT lookup can lead to incorrect direction. To apply dwBFs to scattered resources in overlay network can form a routing correcting mechanism. It can reduce the possibilities of incorrect direction under cases of false positives. To use dwBFs also can resolve another problem with DHT, its ineffectiveness in replica-handle. This paper describes a routing algorithm based on dwBFs and shows the results of simulation experiment.