Abstract
WEB services are autonomous software systems identified by URIs which can be advertised, located, and accessed through messages encoded according to XML-based standards (e.g., SOAP, WSDL, and UDDI) and transmitted using Internet protocols. But it is most difficult to find a proposing service in many services collectives in which services have abundant redundant and similar feature. In this paper, the policy of service hitting is presented, and processes of overcoming invalidation of service binding through calculating the similarity degree among of services and sorting are described. Given web services are in many distributed databases, the algorithm of source optimization is introduced to solve find an optimal service with low cost and availability. In result analysis of experiment, which shows Web services have effect adaptability and intelligent character in discovery process by these optimal search methods supporting.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, S., Lamparter, S., Studer, R.: Making Web services tradable: A policy-based approach for specifying preferences on Web service properties. Web Semantics: Science, Services and Agents on the World Wide Web 7(1), 11–20 (2009)
Clark, D.: Next-generation web services. IEEE Internet Computing 6(2), 12–14 (2002)
Issarny, V., Sacchetti, D., Tartanoglu, F., et al.: Developing Ambient Intelligence Systems: A Solution based on Web Services. Autom. Softw. Eng. 12(1), 101–137 (2005)
Yeganeh, S.H., Habibi, J., Rostami, H., et al.: Semantic web service composition testbed. Computers & Electrical Engineering 36(5), 805–817 (2010)
Pautasso, C., Alonso, G.: Flexible Binding for Reusable Composition of Web Services. Software Composition, 151–166 (2005)
Wang, H., Huang, J.Z., Qu, Y., et al.: Web services: problems and future directions. Web Semantics: Science, Services and Agents on the World Wide Web 1(3), 309–320 (2004)
Shin, D.-H., Lee, K.-H., Suda, T.: Automated generation of composite web services based on functional semantics. Web Semantics: Science, Services and Agents on the World Wide Web 7(4), 332–343 (2009)
Zhu, Q.: The theory of optimal searching in discrete and continuous space, pp. 12–37. Science Express, Beijing (2005) (in Chinese)
Fortin, D.: Optimal searching behaviour: the value of sampling information. Ecological Modelling 153(3), 279–290 (2002)
Bustos, B., Navarro, G.: Probabilistic proximity searching algorithms based on compact partitions. Journal of Discrete Algorithms 2(1), 115–134 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, X., Hu, G., Chen, S. (2011). A Discovery Mechanism of Web Services with Optimal Search Method. In: Zhang, J. (eds) Applied Informatics and Communication. ICAIC 2011. Communications in Computer and Information Science, vol 227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23226-8_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-23226-8_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23225-1
Online ISBN: 978-3-642-23226-8
eBook Packages: Computer ScienceComputer Science (R0)