A Location &amp;amp; Time Related Web Service Distributed Selection Approach for Composition

Liu, Tiejiang; Liu, Zhenyu; Lu, Tun

doi:10.1109/gcc.2010.65

Cited by 3 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The majority of recent studies on web service quality can basically be sorted into two categories, service selection [19,21] and service composition [2,20,[23][24][25]. In general, service selection is to seek the better service instances and service composition is to build better service work flow.…”

Section: Related Workmentioning

confidence: 99%

“…Comparing with service selection and service composition, web service locationrelated research is a newborn in this domain. In study [20], Liu et al have proved that location and time have big impact on service quality, a location-related service composition framework has been proposed. However, this study does not contain any comparison with other existing approaches.…”

Section: Related Workmentioning

confidence: 99%

“…This indispensable factor whereas draw little attraction in the majority of existing studies. The importance of service location, argued by many researches [20,23], must be taken into account, because with the improvement of local computing and high-speed Internet, the only way to reduce network latency is to move the server closer to the client computer. From this standpoint, the issue centers on how to seek an optimal solution for web service deployment on the premise that the server response delay in the range of that can be tolerated by users.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Binary PSO for Web Service Location-Allocation

Tan

Huang

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Web services are independent programmable application components which scatter over the Internet. Due to the improvement on local computing power and development on high-speed Internet, network latency has a significant impact on determining the service response time. Thus, physical locations of web services and users should be taken into account for web service composition. In this paper, we propose a new solution based on the binary PSO-based approach to allocate the service locations. Although several heuristic approaches have been proposed for web service location-allocation, to our best knowledge, PSO-based approach is the first attempt to solve the problem. A simulated experiment is done using WS-DREAM data set with five different complexities. To compare with two GA-based approaches, the proposed BPSO approach has advantages in most situations.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Binary PSO for Web Service Location-Allocation

Tan

Huang

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…A number of these works employ a reconfiguration engine that selects alternative services when necessary [5,6]. Others propose a prediction model, locally selecting services according to forecast information whenever necessary before the composition's performance degrades [31,111,134,103]. Path finding strategies, such as forward/backward chaining [94] and ant colony optimisation [183], are also employed in the context of dynamic Web service composition.…”

Section: Particle Swarm Optimisation (Pso)mentioning

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