A Graph-based Automatic Services Composition based on Cost Estimation Heuristic
Loading...
Files
Permanent Link
Author/Creator
Author/Creator ORCID
Date
2019-10-31
Type of Work
Department
Program
Citation of Original Publication
Lee, Yunsu; Kulvatunyou, Boonserm; Lee, Minchul; Peng, Yun; Ivezic, Nenad; A Graph-based Automatic Services Composition based on Cost Estimation Heuristic; International Journal of Services Operations and Informatics; https://www.nist.gov/publications/graph-based-automatic-services-composition-based-cost-estimation-heuristic
Rights
This item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
Public Domain Mark 1.0
This is a work of the United States Government. In accordance with 17 U.S.C. 105, no copyright protection is available for such works under U.S. Law.
Public Domain Mark 1.0
This is a work of the United States Government. In accordance with 17 U.S.C. 105, no copyright protection is available for such works under U.S. Law.
Abstract
Currently, software and hardware are being virtualized and offered as services on the internet. Companies have an opportunity to improve their workflow by composing these services that best suitable their requirements from both quality and cost objectives. However, as more services become available computer-aided services discovery and composition become essential. Traditional service representation and planning algorithms still have gaps to be filled, particularly related to consideration of non-functional characteristics, large number of similar operators (i.e., services), and limited number of objects (i.e., inputs and outputs per service). This paper analyzes existing works in automatic services composition, service representation and planning algorithm and proposes a new framework to fill those gaps. It proofs that the proposed framework provides an admissible heuristic based on cost estimation that guarantee a minimum cost solution, if one exists.