P2P Probabilistic Routing Algorithm Based on Data Copying and Bloom Filter

Abstract

非结构化P2P 网络资源定位过程中的查询延迟、查准率和查询成本难以同时被优化,为此,提出一种基于副本复制和Bloom Filter 技术的P2P 概率路由算法DCBF(data copying and Bloom Filter).DCBF 基于有向随机网络,对资源对象进行少量的复制,并将各个副本随机路由给网络中的节点;接收副本的节点,以分布式衰减Bloom Filter 向邻近节点传递副本的成员资格信息.理论分析和实验结果均表明,DCBF 仅需复制少量的副本,通过以分布式衰减Bloom Filter 传递副本的成员资格信息,使得网络中的绝大多数节点能够感知到副本的成员资格信息,从而使得各个节点能够以极低的查询代价,在较低的路由延迟范围内,高概率地将查询路由到目标节点.;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.