{"title":"WSCN: Web Service Composition Based on Complex Networks","authors":"Jiaxing Shang, Lianchen Liu, Cheng Wu","doi":"10.1109/ICSS.2013.29","DOIUrl":null,"url":null,"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.","PeriodicalId":213782,"journal":{"name":"2013 International Conference on Service Sciences (ICSS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Service Sciences (ICSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSS.2013.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
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.