Abstract
Currently the research of service science mainly focuses on the composition of distributed and heterogeneous Web services. Most of the approaches proposed to tackle this problem are based on cross-platform workflow and AI planning. However, until very recently, little attention is paid to the approaches based on complex networks. In the era of Big Data, Web services are created and updated in a fast way and their relationships are becoming more complicated. Therefore, studying the basic characteristics of services networks based on complex network theory will be meaningful. In this paper, we propose a framework to model the services network as a directed complex network, in which nodes represent the atomic Web services and the data communicated between them while edges represent the dependent relationship between data and service nodes. Based on the modeled network, we further apply graph search algorithms to solve the problem of Web services composition. Experimental results are given to validate the flexibility and efficiency of our framework.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.