Abstract: In the Decentralized Unstructured Peer-to-Peer(P2P),the peers are usually organized to form an ad hoc overlay network, and the ctueries are propagated among the overlay to search blindly. Since the storage location is independent of the data content, a peer has no idea of which peer is more likely to satisfy a request Therefore, it's vital to find the routing orientation and improve the routing effectiveness. Some semantic methods, such as interest and Ontology, are commonly used in the related work to cluster the peers and to decrease the search range. However, these approaches have not been adopted widely because they are generally limited by the current immature semantic obtainment and description. This paper proposed a novel search method QRRO(Routing Orientation of Query Rate) with the Routing Orientation of Query Rate. In QRRO, each peer is allocated a weight identifier; a peer only indexes for the files whose query rate is close to its weight Therefore, the coupling relation was built up and the routing orientation was formed through query rate. Our simulations show that QRRO is effective in improving the success rate and decreasing the search path length. What's more, QRRO is a pervasive method because the query rate is a non-semantic property of each file.

Key words: Unstructured P2P, Routing orientation, Query rate, Indexing mechanism