An approach for composite service selection based on the records of request/matching
by Rong Yang; Dianhua Wang; Shuwen Deng
International Journal of Services Technology and Management (IJSTM), Vol. 26, No. 2/3, 2020

Abstract: As the emergence of more and more web services, it becomes more difficult to find the candidate atomic services and composing them to form a matched service process, where not only time is strictly limited, but also user demand must be satisfied. In order to solve this problem, this paper presents a service process selection method, which is driven by historical successful service request/matching solutions. Firstly, the system framework model is analysed and several concepts about service selection and composition are formalised. Then, the method model and algorithm are detailed. Finally, through a set of experiments, the effectiveness and robustness of our approach are evaluated.

Online publication date: Mon, 20-Apr-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services Technology and Management (IJSTM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com