Research On Web Service Selection In P2P

P2P is increasingly receiving attention in research because of its distributed and scalability, and more and more Web services are deployed on it. However, the key challenge is Web service selection: ultimately, the service user must select a good Web service provider. The query for Web service in P2P often lead to more answers, so it become the key challenge about how to select the good answer.In this paper, we construct a scalable distributed referral network in P2P and propose a heuristic algorithm for Web services selection through distributed hash table method, which is the most popular and efficient P2P routing algorithm. The work flow include: send out query, collect answers (include referrals), compute locally, select the best answer according to the computing result, rate the provider and modify the models saved in the requester, the model include the quality vector and the referral credibleness. Finally, the experiment results show the accuracy and efficiency of our framework.