Browsing by Author "Lee, Yunsu"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Automatic Service Search & Composability Analysis in Large Scale Service Networks(2015-01-01) Lee, Yunsu; Peng, Yun; Computer Science and Electrical Engineering; Computer ScienceCurrently, software and hardware system components are trending toward modularized and virtualized as atomic services on the cloud. A number of cloud platforms or marketplaces are available where everybody can provide their system components as services. In this situation, service composition is essential, because the functionalities offered by a single atomic service might not satisfy users' complex requirements. Since there are already a large number of available services and significant increase in the number of new services over time, manual service composition is impractical. In our research, we propose computer-aided methods to help find and compose appropriate services to fulfill users' requirement in large scale service networks. For this purpose, we explore the following methods. First, we develop a method for formally representing a service in term of composability by considering various functional and non-functional characteristics of services. Second, we develop a method for aiding the development of the reference ontologies that are crucial for representing a service. We explore a bottom-up-based statistical method for the ontology development. Third, we architect a framework that encompasses the reference models, effective strategy, and necessary procedures for the services search and composition. Finally, we develop a graph-based algorithm that is highly specialized for services search and composition. Experimental comparative performance analysis against existing automatic services composition methods is also provided.Item A Graph-based Automatic Services Composition based on Cost Estimation Heuristic(National Institute of Standards and Technology, 2019-10-31) Lee, Yunsu; Kulvatunyou, Boonserm; Lee, Minchul; Peng, Yun; Ivezic, NenadCurrently, 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.