关键词: P2P网络，Bloom Filter,概率分发队列，响应时间

Abstract: The strategy of searching resource is a research hotspot in unstructured peer to peer network. It is hard to optimize response time, ctuery hit, and coverage rate for resource location of unstructured P2P network simultaneously.This paper presented a quickly search algorithm called BFPDQ (Bloom filter and probabilistic distribution queue)，which is based on probabilistic distribute queue and Bloom filter technology. I3FPDQ is mainly used for acyclic random network. Information of resources and requests can be expressed by Bloom filter technology. Meanwhile, performance information of the underlying network's path can be used to guide transmitting strategy for upper layers. PDQ (probabilistic distribute queue) uses distributed queues to substitute traditional walkers to search resources. Requester coordinates direction and depth of those queues and aggregates their resource location messages. Simulation results show that BFPDQ can decrease redundant information, while maintaining a significant reduction in response time.

Key words: Peer to peer network,Bloom filter,Probabilistic distribution queue,Response time