full
search.png

Search

close.png

Cancel

arrow
Volume 2, Issue 1
A Routing Mechanism by Distance-weighted Bloom Filter

J. Info. Comput. Sci. , 2 (2007), pp. 55-60.

Purchase PDF 68 1089

Cited by

google scholar semantic scholar
Export citation
  • 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.
  • Keywords

Bloom filters, Distributed Hash Table (DHT), overlay network, distance-weighted Bloom filter(dwBF)

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JICS-2-55, author = {}, title = {A Routing Mechanism by Distance-weighted Bloom Filter}, journal = {Journal of Information and Computing Science}, year = {2024}, volume = {2}, number = {1}, pages = {55--60}, 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. }, issn = {1746-7659}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jics/22820.html} }
TY - JOUR T1 - A Routing Mechanism by Distance-weighted Bloom Filter AU - JO - Journal of Information and Computing Science VL - 1 SP - 55 EP - 60 PY - 2024 DA - 2024/01 SN - 2 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jics/22820.html KW - Bloom filters, Distributed Hash Table (DHT), overlay network, distance-weighted Bloom filter(dwBF) AB - 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.
. (2024). A Routing Mechanism by Distance-weighted Bloom Filter. Journal of Information and Computing Science. 2 (1). 55-60. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard