Research On Semantic Web Service Discovery

In the current Internet, the P2P application ties up the most network resourse, which is more than WWW. The P2P development doesn't only in business but also in scientific research. Because the random search exists the limitation of extending characteristic in the completeness distributing networks, the most of research focus on how to build structural P2P system,the representativest one is Pastry thereinto.Pastry is a DHT rounding protocol which achieves extending distributing localization.the Pastry rounding arithmetic that searchs the information resource can assure the rounding hops is less than O(logN)(N is the number of nodes).Pastry is in completeness structural P2P networks, so the limiting condition is very strict. We choose improving the traditional Pastry rounding arithmetic to advance the capacity of rounding and searching.The main research contents and feature of this paper are as follow:(1) This paper introduces the correlative P2P knowledge, and gets the character of every P2P network model from comparing to each other. At the same time every DHT rounding mechanism is researched.(2) In this paper, a new routing algorithm is proposed, based on unstructured hybrid network. It uses index node and search node, and realizes a well-ordered search from a global view. The networks model of the new routing algorithm; the method how to deal with nodes adding and lapsing is introduced in detail. (3) The paper introduces the process how to actualize the improving algorithm and lists some program paragraph and some UI (User Interface) which can represent the characteristic of improving algorithm.The paper indicates that the new routing algorithm is more effective form two methods which are in theabstract and in the experiment.