A Service Chain Discovery and Recommendation Scheme Using Complex Network Theory

Liu, Guoqi; Zhao, Yuli; Wang, Zhuang; Ying, Liu

doi:10.1155/2014/157085

Cited by 3 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…And last, the notion of QoS appears. Note that in [25] and [26] the authors also deal with QoS. [12] propose an inter-connected service composition graph to support service discovery and composition processes.…”

Section: Related Workmentioning

confidence: 99%

A Web Service Composition Framework Based on Centrality and Community Structure

Chhun

Malang

Cherifi

et al. 2015

2015 11th International Conference on Signal-Image Technology &Amp; Internet-Based Systems (SITIS)

View full text Add to dashboard Cite

Reusing existing services for developing business process applications helps reducing the development time and cost. Besides, existing atomic services may not be able to answer users' requirements. Therefore, as manual composition takes time and is error prone, automatic service composition methods are needed. Their objective is to find the best composite service with minimum number of services and the best performance in term of Quality of Service (QoS). In this paper, a complex network based service composition framework is proposed. It is based on a network representation of the Web service space, making it possible to exploit efficiently various centrality properties and its community structure. It applies the A* search algorithm by considering different network centralities (degree, betweenness, closeness) together with various static and dynamic QoS attributes (execution time, availability and number of calls, changing values of QoS over different timestamps) in its heuristic. Furthermore, the network community structure is integrated in the process, in order to reduce the execution time and increase the accuracy of composition.

show abstract

Section: Related Workmentioning

confidence: 99%

A Web Service Composition Framework Based on Centrality and Community Structure

Chhun

Malang

Cherifi

et al. 2015

2015 11th International Conference on Signal-Image Technology &Amp; Internet-Based Systems (SITIS)

View full text Add to dashboard Cite

show abstract

“…In the field of service computing, there are two kinds of techniques related to our method. One is sub fragment discovery [34,26,1], and the other is sub segment recommendation [16,30,18]. Typically, a separate OGC Web services provides a simple function.…”

mentioning

confidence: 99%

Web services recommendation leveraging semantic similarity computing

Hu¹,

Cheng²,

Zhou³

2018

Mathematical Foundations of Computing

View full text Add to dashboard Cite

With the popularity of Web services adopted for supporting domain applications, recommending and composing appropriate services with respect to user requirements is a challenge. This paper proposes a dynamic programming and variable length genetic algorithm for the recommendation and composition of Web services. Generally, starting and ending services are determined leveraging the constructed service network model. Based on which, services are selected and composed, such that these services should be more appropriate on satisfying users' requirements. Experimental evaluation result shows that our technique is effective and can improve the accuracy of service recommendation.

show abstract

“…This suffix will be used when creating all the neighbours. Then, for each service s in the original sequence, a group of up to p predecessors of s (where p is the same pa-datasets were chosen because the generation of meaningful composition benchmarks is not a straightforward task, and because they are the largest benchmarks to have been broadly employed in the composition literature [17,158,108]. WSC-2008 and WSC-2009 were developed for the Web Services Challenge, a competition held at the 10th and 11th editions of the IEEE Conference on Commerce and Enterprise Computing [16,95].…”

Section: Variable Length and Memetic Variable Length Methodsmentioning

confidence: 99%

Evolutionary Computation for Multifaceted Web Service Composition

Silva¹

View full text Add to dashboard Cite

<p>Automated Web service composition is one of the holy grails of service-oriented computing, since it allows users to create an application simply by specifying the inputs the resulting application should require, the outputs it should produce, and any constraints it should observe. The composition problem has been handled using a variety of techniques, from AI planning to optimisation algorithms, however no work so far has focused on handling multiple composition facets simultaneously, producing solutions that: (1) are fully functional (i.e. fully executable, with semantically-matched inputs and outputs), (2) employ a variety of composition constructs (e.g. sequential, parallel, and choice constructs), and (3) are optimised according to non-functional Quality of Service (QoS) measurements. The overall goal of this thesis is to propose hybrid Web service composition approaches that consider elements from all three facets described above when generating solutions. These approaches combine elements of AI planning and of Evolutionary Computation to allow for the creation of compositions that meet all of these requirements. Firstly, this thesis proposes two novel approaches for Web service composition with direct representations. The first one is a tree-based approach where the leaf nodes are the atomic services included in the composition and the inner nodes are the structural constructs that shape the composition workflow. The second one is a graph-based approach where the atomic services are the vertices and the edges connecting them form the composition workflow. The two approaches are compared to determine which is most suitable to the QoS-aware fully automated Web service composition problem. Secondly, this thesis proposes novel sequence-based approaches for Web service composition that use an indirect representation, i.e. they encode solutions as sequences of services. By representing solutions in this way, it is possible to initialise and evolve them without having to enforce their functional correctness. Then, before evaluating the fitness of each solution, a decoding algorithm is used to transform the sequence into the corresponding composition. The decoding algorithm builds the workflow using the ordering in the sequence as closely as possible when selecting the next service to be added, while at the same time generating a functionally correct structure. Thirdly, this thesis treats Web service composition as a multi-objective problem, generating a set of trade-off solutions the user can choose from. More specifically, it proposes multi-objective approaches to fully automated Web service composition, which means that conflicting QoS attributes are independently optimised using a variety of representations that support flexible workflow structures. Additionally, a multi-objective and fully automated memetic approach that uses a local search operator to further improve the quality of solutions is proposed. The following major contributions have been made in this thesis. Firstly, two approaches for Web service composition with direct representations were proposed. When the choice construct is not considered, the graph-based approach produces solutions of higher quality than those of the tree-based approach, but the opposite is true when the choice construct is included. Secondly, indirect representation approaches for Web service composition were proposed. These approaches perform well and can produce solutions with better quality than those found by the graph-based approach. Finally, we propose multi-objective approaches to fully automated service composition, employing different problem representations and a local search operator. The multi-objective approaches using the sequence-based representation were found to produce solutions with better overall quality.</p>

show abstract

A Service Chain Discovery and Recommendation Scheme Using Complex Network Theory

Cited by 3 publications

References 14 publications

A Web Service Composition Framework Based on Centrality and Community Structure

A Web Service Composition Framework Based on Centrality and Community Structure

Web services recommendation leveraging semantic similarity computing

Evolutionary Computation for Multifaceted Web Service Composition

Contact Info

Product

Resources

About