A Tree-based Method of Web Service Composition

Author

Tang, Haiming ; Zhong, Farong ; Yang, Chang

Author_Institution

Dept. of Comput. Sci., Zhejiang Normal Univ., Jinhua

Volume

1

fYear

2008

fDate

6-8 Oct. 2008

Firstpage

204

Lastpage

209

Abstract

One of the most promising ideas underlying Web services is service composition, that is, to provide new value added services by combining some pre-existing Web services. Although though service composition has received a great deal of attention tention and there are many solutions to the problem of composition, finding potential service compositions efficiently is still challenging because of the fact that the number of candidate services can be very large. In this paper, a tree-based method of Web service composition is proposed, by which all potential candidate composite services that meet the user´s request can be created. Moreover, these composite services are ordered according to the QoS attribute concerned by the user, so the user can find the best and arbitrary top-n composite services.

Keywords

Web services; quality of service; tree data structures; QoS; Web service composition; composite service; tree-based method; value added service; Adaptive systems; Assembly; Binary trees; Computer science; Packaging; Process planning; Proposals; Scalability; Simple object access protocol; Web services; Composite Service; Service Composition; Service Discovery; Web Service;

fLanguage

English

Publisher

ieee

Conference_Titel

Pervasive Computing and Applications, 2008. ICPCA 2008. Third International Conference on

Conference_Location

Alexandria

Print_ISBN

978-1-4244-2020-9

Electronic_ISBN

978-1-4244-2021-6

Type

conf

DOI

10.1109/ICPCA.2008.4783577

Filename

4783577