A graph-based automatic services composition based on cost estimation heuristic Online publication date: Tue, 05-Nov-2019
by Yunsu Lee; Boonserm Kulvatunyou; Minchul Lee; Yun Peng; Nenad Ivezic
International Journal of Services Operations and Informatics (IJSOI), Vol. 10, No. 2, 2019
Abstract: Currently, both software and hardware are being virtualised and offered as services on the internet. Companies have an opportunity to improve their workflows by composing services that best suit their quality and cost requirements. However, as more services become available, computer-aided services discovery and composition become essential. Traditional service representation and planning algorithms do not adequately address non-functional characteristics, large numbers of similar operators (i.e., services), and limited numbers of objects (i.e., inputs and outputs per service). This paper analyses existing work in automatic services composition, service representation and planning algorithms and proposes a new framework to address those needs. It proves that the proposed framework provides an admissible heuristic based on cost estimations that guarantee a minimum cost solution, if one exists.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Operations and Informatics (IJSOI):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook