A Fast Web Service Searching Algorithm Based on P2P Networks
Yuanda Cao · Microelectronics & Computer · 2009
In order to avoid the single-point-failure problem in centralized Web service publishing and finding mechanisms,a fast searching algorithm based on P2P networks was proposed in this paper. Service Alliance composed Web services with same content. Service requests could be spread rapidly through out the alliance by means of the alliance information. This improved the efficiency of services to be found. The experimental results in PeerSim platform showed that the algorithm could find targets more fastly and roam over a greater scope.