[Show abstract][Hide abstract] ABSTRACT: Node clustering is an efficient way to improve query hit radio and decreases network traffic cost in unstructured P2P topology. In this paper, we study the relationship between the similarity of peers properties and system clustering coefficient. It demonstrates that increase peers-similarity is an efficient way to increase system-clustering coefficient. By this theorem, we have proposed three algorithms base on unstructured P2P topology to improve the peers-similarity. The experiments show the algorithms will help P2P system reflect the small-world characteristics and reduce the average time complexity of per lookup request.
[Show abstract][Hide abstract] ABSTRACT: To enable efficient and appropriate uses of the resources in web, it is important to provide range query to keep track of the availability and attributes of millions of service which are geographically distributed. Range query in P2P face a performance tradeoff problem between the efficiency of query and number of message: Optimizing one tends to put pressure on the others. In this paper, a range query algorithm had proposed which lookup for every node in range can be done via O(logN) hops, and number of messages is trend to O(logN)+m-1. We evaluate our system in this paper via a simulation and show that its design along with particular Range-query algorithm meets the goals of efficient query and low message load.