%0 Journal Article
%T P2P Probabilistic Routing Algorithm Based on Data Copying and Bloom Filter<br>基于副本复制和Bloom Filter 的P2P 概率路由算法
%A ZHU Gui-Ming
%A GUO De-Ke
%A JIN Shi-Yao
%A <br>朱桂明
%A 郭得科
%A 金士尧
%J 软件学报
%D 2011
%I 
%X It is hard to optimize query latency, query hit, and query cost at the same time for the resource location of unstructured peer-to-peer network. For this problem, this paper presents a probabilistic routing algorithm called DCBF (data copying and Bloom Filter), which is based on data copying and a Bloom Filter technique. DCBF makes a few copies of each shared resource and places each copy on a random selected node, based on a directed random network. Each node forwards membership information to neighboring nodes with distributed declining Bloom Filters. Analysis and experimental results show that DCBF can make the most of the nodes, use the membership information of resource objects by making only a few copies, and forward membership information with distributed declining Bloom Filter to achieve high query hits with low cost and low latency.
%K peer-to-peer computing
%K directed random network
%K data copying
%K decaying Bloom Filter
%K probabilistic routing<br>对等计算
%K 有向随机网络
%K 副本复制
%K 衰减Bloom
%K Filter
%K 概率路由
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=2E4328965475D74A40A98507F7235437&yid=9377ED8094509821&vid=BC12EA701C895178&iid=E158A972A605785F&sid=1F7317C17A9AF4FA&eid=DBEE434FCBFED297&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=18