Research Of The Semantic Web Service Discovery Method Based On R-chord

With the propose and development of the web services, however, the Internet has beenradiating a new vitality into the Web2.0era. Web services abandoned the C/S architecture,steering B/S structure, and can be described published, found, composed and called via theInternet, all made it into an open specification. Because it can be an effective organization,integration, operation data and information on the Web, so it is already has been become anew distributed computing model. Web services technology is constantly becoming more andmore mature, a lot of e-business adopt it as effective solution. As a result, the number and thetype of the Web services on the Internet has explosive growth, thus, how to locate the serviceswhich customer wanted quickly, accurately and effectively has always been the subject ofmany scholars.This paper first outlines the Semantic Web Service Discovery Research Status both inhome and abroad, and then, describes some of the related technologies of Web services andSemantic Web services. By knowing that at present main research direction is servicesdiscovery the under distributed network environment, so the article also described on P2Ptechnology. Finally, according to the analysis of four kinds of P2P network topology modelperformance, decided to use Chord as the reform target of routing method, proposed a theoryof Chord routing based on hierarchical resource discovery model (R-chord). To compress therouting table we increased a shielded bit in the finger table during the model design process.And through simulation experiments to find the average number of hops from the node failurerate of the average distance, and find other aspects of the original Chord routing method andcompared to prove the validity of such routing model.Secondly, this paper proposed a Semantic Web Service discovery model based onR-chord routing method. In this discovery model we realized two mechanisms to improve theefficiency, which are advanced search for matching and hierarchical search, proposed asolution of semantic Web service discovery in distributed environment.Finally, by simulation analysis and compared with the existing service discovery model,this model can be a good efficiency of service discovery with service precision rate and recallrate balancing. The result shows that, the model has advantage in, lower network load, lower system overhead and less average routing hops.