This paper proposes a system named AWSCS (Automatic Web Service Composition System) to evaluate different approaches for automatic composition of Web services, based on QoS parameters that are measured at execution time. The AWSCS is a system to implement different approaches for automatic composition of Web services and also to execute the resulting flows from these approaches. Aiming at demonstrating the results of this paper, a scenario was developed, where empirical flows were built to demonstrate the operation of AWSCS, since algorithms for automatic composition are not readily available to test. The results allow us to study the behaviour of running composite Web services, when flows with the same functionality but different problem-solving strategies were compared. Furthermore, we observed that the influence of the load applied on the running system as the type of load submitted to the system is an important factor to define which approach for the Web service composition can achieve the best performance in production.
Citation: Tardiole Kuehne B, Estrella JC, Nunes LH, Martins de Oliveira E, Hideo Nakamura L, Gomes Ferreira CH, et al. (2015) AWSCS-A System to Evaluate Different Approaches for the Automatic Composition and Execution of Web Services Flows. PLoS ONE 10(6): e0127677. https://doi.org/10.1371/journal.pone.0127677
Academic Editor: Muhammad Khurram Khan, King Saud University, Kingdom of Saudi Arabia, SAUDI ARABIA
Received: November 19, 2014; Accepted: April 17, 2015; Published: June 12, 2015
Copyright: © 2015 Tardiole Kuehne et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited
Data Availability: All relevant data are within the paper.
Funding: This work was supported by Coordination of Improvement of Personal Higher Education (CAPES), National Council for Scientific and Technological Development (CNPq), and Sao Paulo Research Fundation (FAPESP), processes 11/09524-7, 13/26420-6, 09/16055-3.
Competing interests: The authors have declared that no competing interests exist.
Web services have emerged from paradigm of distributed computing called Service-Oriented Computing (SOC). This enabled enterprises to integrate services across different platforms and technologies through the composition of services .
The development of composite Web services is a complex task for developers, possibly because the search for Web services which can be part of the Composite Web service is not trivial. In  an experiment using students to develop composite Web services is presented. This experiment indicates that the most difficult part of the creation of new composite services is the discovery of pertinent Web services to achieve the goal.
In order to solve this problem the use of semantic Web services was proposed. With semantic Web services it is possible to find services and their relation according to the semantic links between them. It enables the use of services in cooperation for a wider purpose. Semantic Web services enable the Automatic Web Service Composition (AWSC) through algorithms that can find services and compose them, according to the users input and output formatted as semantic rules.
Several proposals of how to achieve automatic Web Services composition are available in the literature. However, the development of AWSC algorithms is a very complex task and their evaluation are usually restricted to a specific environment. Also, the evaluation of the results of these algorithms only considers the semantic quality  of the composition, and is based on static Quality of Service (QoS) parameters.
The main language for Web service composition is WS-BPEL. WS-BPEL provides a language for business processes. It extends the Web service interaction model and enables it to support business transactions . WS-BPEL is the standard for Web service composition, being a robust and powerful language to create interaction between Web services. To create a WS-BPEL composite service it is necessary to write the WS-BPEL source code, describe the partner services, compile the code and deploy it in a WS-BPEL engine application server. These tasks make the process of creating a composite service complex, but were crucially manual. However, an AWSC algorithm does generate very make so complex flows and it does not need robust and complex controls of execution as WS-BPEL provides.
For this issue, a lightweight engine that is capable to manage the Composite Web service execution is proposed. AWSC algorithms are restricted to connect the output from one service to the input of another one. The engine proposed in this paper can handle those kind of operations including parallel execution and synchronization.
In this paper we propose a Automatic Web Service Composition System (AWSCS), which provides a specific environment designed to evaluate Web services automatic composition approaches under specific conditions. The main goal of AWSCS is to assist decisions through the performance evaluation of the available composition approaches. The evaluation is based on QoS parameters wich are meansuring during the execution, such as response time or availability. A case study using the AWSCS prototype considers some empirical synthetic composition flows. Each one of these flows has the same semantic quality and uses several abstract services to solve the proposed problems. In this scenario, two flows were developed aiming to solve a problem of trip planning.
The paper is organised as follows: Section 1 describes the state of the Art. Section 2 describes the prototype of the AWSCS system proposed in this paper. Section 3 presents an environment used to deploy AWSCS and to run experiments. The results collected are discussed in Section 4. Finally, the conclusions and directions for future work are presented in Section 5.
1 Related Work
The terms manual, automatic, static or dynamic composition are common terms in the related literature. According to the papers   dynamic and static are classifications that can be applied in automatic and manual composition. Static composition refers to the association of each service implementation at design time. It means that the service to perform each function of the flow is selected by the programmer in design time. In dynamic composition the services instances are selected at runtime, but the kind of service that composes the flow is selected at design time. Manual and automatic composition are two major classifications: in manual composition a graph describing execution flow and logical reference to Web services is planned by a developer. Automatic Web service composition (AWSC) is the process of creation a new composite service according to the request of an user by a computational system without any intervention of humans.
The process of AWSC can be divided in to three main parts: the matchmaking of the service, service selection and services execution. The matchmaking is responsible for the creation of semantic links between services. The semantic link is the connection between services that occurs when one service has an output which is equivalent to the input of another one. An example of matchmaking algorithm is presented in , where it checks the full combination of all services available in the registry. The result is a graph with all possibilities of connection between semantic Web services. It was one of the early works in this topic and it has poor performance when there is a large amount of services. It is difficult to calculate all combinations every time the environment changes. To improve the matchmaking other papers also present matchmaking approaches such as in , in which the author proposes the development of hybrid Web service matchmaking. In  matchmaking framework based on Description Logic for semantic Web service described by RDF4S model is presented. In  the author presents the SAWSDL-iMatcher, a matchmaking that can be customised, in which the users can use their preferred strategies for matchmaking according to the application requirements.
After the matchmaking has created all the semantic links between the services, the algorithm for Web service selection is performed to find the most appropriate services to processes the user request. In  the matchmaking model for the service composition is made through a multilayer process which creates a plan graph structure within a matrix of semantic links. To make the selection, an Immune-inspired algorithm is used. In  the matchmaking algorithm proposed by  is used to create the semantic links between the services. Then Dijkstra’s algorithm is applied to find the best path for the service composition. In  the author use OWL-S Web service semantic presentation to describe the composition problem as a planning problem described in a standardised way using PDDL. Thus it is possible to use AI techniques to find the best services for the composition. Other approaches for service selection are also presented in  . The matchmaking and selection approaches are examples of what would be possible to evaluate using the AWSCS.
Many works have focused on how to automatically compose Web services. Usually, they show algorithms for automatic composition of Web services, but do not present an assessment of the execution of the resultant flow behaviour.
Actually, just a few research works evaluate and compare these proposals. In addition, the assessment of the behaviour of performing in a real environment could not be found in any work in the literature. The evaluation of the performance of Web services composition are presented in , ,  and . Zhao proposed a simulation-based environment to make Web services composition based on Petri network models. This work does not evaluate the performance of the automatic composition of Web services.
In  an approach of how to choose the best flow through the use of stochastic Petri nets is presented. This work used analytical methods to evaluate the performance of composite service models. So, it is difficult to measure the impact on performance in some specific cases, such as, when the system is overloaded as a whole.
In  stochastic Petri nets are also used with the aim of evaluating dynamic manual composition. After the creation of the service flow, the user can manually choose the desired services to use in the service flow, considering their QoS atributes values.
In  an approach using queueing Petri nets for modelling Business Process Execution Language (BPEL) flows is also presented. The authors use simulations to evaluate the performance of the composition. In this work they evaluated the change in average response time.
An adaptive genetic programming approach (AGP) for QoS-aware web services composition is proposed in . They merge the services composition and QoS-aware service selection process to meet both functional and non-functional goals. Also, they compared the AGP with a standard genetic algorithm but, as there are no available benchmark datasets for evaluation purpose, they randomly generated five requests with seven sets of web services for the experiments which has the maximum number of 500 web services. The simulation experiments shows the best performance of AGP to discovering a composite service with various workflow constructs that meets the functional requirements as well as QoS requirements.
In  is presented the new concept of composition context together with a novel service selection algorithm. Based on the composition context, the authors presented a novel Backward Composition Context based Service Selection (BCCbSS) approach to meet the composition context aware challenges. Although the authors have not implemented these concepts, they are important to study or play real-world scenarios, using the AWSCS.
OWL, OWL-S and SPARQL are used to compose and invoke semantic web services in managing production processes in . The approach involves the combination of three web services, the first one maintains a semantic model that describes the system state, and the others uses the model to compose the domain web services. Unfortunately, the paper does not present any results of a performance evaluation.
In  an extensive set of experiments was conducted, using 30 web service repositories (with a total number of 7,275 web services), that are from six simulated predefined composition workflow models. Each workflow corresponds to five web service repositories, that are generated candidate operations for the tasks in the workflow, and also randomly adding operations outside of the workflow. The approach does not depend on a predefined workflow model for QoS-aware service composition problem, wich is better than the IP-based approachs, that cannot ensure global satisfiability. The experiments show that the comprehensive QoS of a composite service found by our approach outperforms that generated by the IP-based available in the literature. The QoS value of a composite dependence graph found is always better than that of a composite service found by the IP-based approach.
We have discusses work in the literature regarding the evaluation of performance in composition Web services. Most of these works do not offer the possibility to evaluate algorithms for automatic composition of Web services. Another point in common between these studies is that they use analytical models or simulation. The problem with using these approaches is that it is very difficult to describe analytically or simulate the execution behaviour of the composition, since several factors may influence the results, such as overloading the system, types of machines used in providers and types of clients that access the system.
With AWSCS it is possible to make a fair evaluation of automatic composition algorithms, as they are deployed in a common environment, helping the stakeholder to choose the best approach for its solution.
It also allows performance evaluation in a modular way, by inserting monitors that record performance metrics on a log server.
The AWSCS architecture has two distinct modules: the automatic composition module (ACM) and the composite execution module (ECM). AWSCS is currently couple to WSARCH which allows for performance evaluation of Web services. The WSARCH architecture  has five distinct modules: the client application, the providers, the Broker, the UDDI registry and the Log Server. Fig 1 shows the relationships between these components.
The component diagram in Fig 2 shows the main modules that compose the architectural model for performance evaluation used by the AWSCS system.
- Automatic Composition Module: This module is where the user can deploy the approache for the AWSC. The AWSC approache choose to be used is the responsible to find Web services candidates and generate the flow of execution which fulfil the user request. The prerequisity to make the AWSC approache to work on AWSCS the generation of the output flow following the XML Schema. Since no implementations of algorithms for AWSC are publicly available for download and test, in this paper we simulated this module.
- Composition Execution Module: receives the resulting flow from the Automatic Composition Module. The CEM is responsible to parse the XML containing the composition flow and control the execution of the composite Web service, ensuring that parallel and sequential services are running in the correct order.
- Service Provider Repository: store the semantic descriptions and interfaces to perform the services requests.
- XML Flow Verifier: checks the resulting XML flow created by “AWSC Matchmaking + AWSC Selection Algorithm” module. If the XML file is corrupted or poorly formatted, AWSCS will abort the execution.
- WSArch Broker: responsible to accomplish the SLA agreement. It looks for a specific service that meets the SLA established between the service and the client module.
- LogServer: database which stores all records from execution for later analysis.
- Web service Providers: hosts where Web services are deployed and executed.
- Monitor: code inserted into WSArch Broker and AWSCE modules to measure the time spent on each part of the execution of the service code.
For the functioning of this system, the outcome composite Web service from an AWSC algorithm, must be able to be executed automatically. Using BPEL, it is necessary to assembly files to make a composite service, create partner links and deploy the composite Web service in a composition engine.
In order to allow automatic execution, an XML file containing the description of all Web services needed to perform the composite Web service is generated by the composition algorithm. An XML schema which defines the standard format of AWSCE XML files was proposed.
The XML Schema presented in Fig 3 is composed of three basic elements which are in the CompositeService Tag: CompositionName, Service and Connection.
- CompositeService: Tag that identifies the name of the composition.
- Service: For each Web service that is part of the flow, a tag Service is created. This tag contains the basic information to run the Web service. It is composed of 5 elements:
- ID: unique identifier for the Web service.
- Name: The name of Web service;
- Operation: It is the operation name that the Web service will execute.
- Parameters: Corresponds to the input parameters of the operation. It is a complex type, since an operation can have zero or more parameters. A parameter can be either a variable containing the result of another Web service or a value specified by the user who requested a composite Web service.
- Class: Service performance class to be executed. The options are Bronze, Silver or Gold.
- Output: Web service execution output.
- Connection: This tag is responsible for identifying the execution order of the Web services.
3 Performance Evaluation
As no algorithm for automatic composition was found for download and test, for the purpose of testing AWSCS we simulated a scenario where we elaborated possible resulting flows from different approaches for automatic Web service composition.
As the focus of this paper is on the framework for comparing approaches we did not look at evaluating the creation of workflows and the simulated scenario allows to overcome the unavailability of composition algorithms while allowing us to perform the needed evaluations. Two flows with the goal of solving a problem of trip planning was considered. The resulting compositions of the flows have the same semantic quality based on the user request, but different abstract Web services to solve the problem.
For planning and execution of experiments PEESOS (Planning and Execution of Experiments in Service-Oriented Systems) was used as an auxiliary tool . PEESOS is a tool focused in capacity planning and execution in SOA. PEESOS instructs the user to conduct a full factorial experiment from a set of default entries and provides a real testbed environment, in which the workload is generated through a collaborative environment.
All the experiments used in this paper were conducted using PEESOS.
3.1 Environment Configuration
The environment used in the tests was composed of two clusters, one whose primary function is to host the WSArch and another that is used to host the clients and AWSCS. The specifications of the machines of the cluster are presented in Tables 1 and 2.
In Fig 4 an overview is presented, containing the number of machines used, and how they are interconnected. The entire environment uses a gigabit network.
In the WSArch cluster presented in Table 1, four physical machines were used for hosting providers, in which each physical machine has three virtual machines, and each virtual machine hosts a provider of Web services, generating a total of 12 Web services providers. Each of the virtual machines has a dedicated gigabit network adapter to avoid package collision during the experiments. The Broker, UDDI, LogServer and PEESOS was hosted on a real machine.
In the second cluster, presented in Table 2, the clients and also the system AWSCS were hosted. For this experiment 5 machines with the AWSCS were used.
3.2 Selection Algorithm
The selection algorithm used in this experiments was the Euclidean Distance. However another approaches for QoS selection can be implemented in the WSArch Broker. The goal of the algorithm in this context is to find the Web service with QoS values closest as possible to the required value by the client . The Euclidean distance is calculated by the Eq 1. (1)
It is important to point that this algorithm was used to select the concrete Web services for composition. Therefore, this algorithm has the purpose of providing QoS in execution and not achieve automatic composition of Web services. For providing QoS in the context of this project, the selection of Web services was performed according to the following criteria:
- For the Gold class, the algorithm aims to get the lowest response time. The goal is also to get the Web service with the best reputation possible. Since the cost is not a problem for this class, the algorithm tries to reach an average value. Thus the QoS attributes cost and response time are a priority for the Gold class.
- For the Silver class the algorithm aims to achieve all the goals achieving the average values for each QoS attribute.
- For the Bronze class the algorithm aims to achieve the minimum cost and the other attributes are already relaxed.
In the literature there are several proposals for Web services selection in the Web service composition context. Some examples of other proposals are presented in    , and these could easily be used in the proposed work as alternatives to the three level system.
In Table 3, the SLAs contracts for the Web service composition flows used in our proposed scenario are presented. For each class a value is given that must not be exceeded for response time and cost and never be undercut for reputation. These SLA contracts are established according to the QoS offerings available for each Web service.
In the proposed scenario, two flows with the goal to propose a trip planning were developed. Both flows has the same semantic quality, since the aim of this paper is to evaluate the performance of the execution. The request considered for preparing the flow comprises the application for booking, transportation to the city of destination and back, transfers within the city and some events for entertainment.
Fig 5 shows flow 1. Flow 1 is formed by the Web service Hotel for hosting, TripBus regarding transportation to the destination city, CityBus for internal transfers and the Web services Event1, Event2, Event3 and NightEvent for entertainment.
Flow 2, shown in Fig 6, is composed of the Web services Roost for hosting service, Flight for the trip to the destination city, Taxi for internal transfers and the Web service Event Packet, a package of events responsible for providing entertainment to the client.
In this section the results obtained by the execution of the experiments described in Section 3 are reported.
The experiments were performed following a full factorial combination and 10 replication for each possible configuration, resulting in 40 executions for each experiment. To calculate the confidence interval, a 95% confidence level was used. The load used for this experiment consists of 50 clients, the executions are controlled by PEESOS. The implementation follows an exponential distribution, also generated by PEESOS, to trigger the requests of these 50 clients.
4.1 Experiment 1
In the first experiment, we evaluate the behaviour of the implementation of the composite Web services, flow 1 and flow 2, in a scenario where only Gold class Web services were accessed. In Table 4 factors and levels used in the experiment are presented.
In Table 5 the SLA contracts that must be respected during the experiment execution are described. Although all Web services run in parallel, the response time contract is set to 2 seconds longer than the highest Web service response time. This happens because the system needs some time to create the call and execute it against the Web service. Without that extra time, it would be impossible to meet the SLA in any condition of the system.
Fig 7 shows the Graphs related to the results of flows 1 and 2, where requests were executed in bursts every 3 seconds. For QoS attributes cost and reputation (graphs (b) and (c) respectively), there is no need to calculate the confidence interval, since these attributes are not associated with implementation and replication of the experiment execution, but are related with the choices of Web services that will be executed by the algorithm presented in Section 3.2.
In terms of reputation both flows have achieved the goal of the best possible. In terms of cost the first flow obtained considerably lower values, due to the types of Web services chosen, since in flow 1 the travel between cities is by bus, while in flow 2 is performed using plane. Also, flow 1 uses bus for local transport while flow 2 uses a taxi.
For the overload situation presented in the Graph (a) of Fig 7, the executions in bursts occur every 3 seconds. The flow 1 obtained a considerably worse performance compared to flow 2, since the average of the result surpasses the limit of the contract by 2 seconds. For flow 2, the average response time gets values a little above the limit from the SLA (which was defined as 8 seconds). Despite using different services in experiment 1 the flow 2 managed to be more efficient than flow 1, with the same load submitted to the system.
In Fig 8 the results for experiment 1 are presented, however, clients send requests in bursts each 9 seconds, slightly overloading the system. As the results obtained for the attributes of QoS cost and reputation are unaffected by the behaviour of execution, and in this case clients were all from Gold class, the results were repeated, as it is possible to observe in the Graphs (b) and (c) of Fig 8.
In the Graph (a) of Fig 8 in is possible to notice that flow 2 is able to maintain performance approximately 2 seconds below the SLA requirements fulfilling the contract for all requisitions. The flow 1, manages to in most times fulfil the SLA contract, however for some cases it did not happen, since the confidence interval got a little above 9 seconds.
In Fig 9 the factors that most influenced the experiment are presented. As QoS attributes reputation and costs are fixed, it means that they do not vary with the execution, so it does not make sense to do this type of calculation for such factors (it always will result in 100% for the algorithm and 0% for the load). So in Fig 9 we present the influence of factors only for the response time. The calculations used in this paper to measure the factors effects was made based on the techniques presented in the book .
In the case of the first experiment, it is possible to note that the execution is critical to the effects of the flow used in response time, since the flow execution had 41% of effect on the results of this experiment.
4.2 Experiment 2
In experiment 2, we evaluated flows 1 and 2, considering a scenario in which the SLA was different for five types of clients. In Table 6 the classes for each Web service accessed are presented. In Table 7 the SLAs defined for each one of the five clients are presented.
The factors are presented in Table 8.
In Fig 10 the results for the response time in the execution of flows 1 and 2 are shown. In cases where the bursts occur every 1 second, this entails a greater load on the system when compared with bursts triggered every 9 seconds. As in experiment 1, the C3 client that requests most Web services in the class Gold for both flows, performed better in the second flow. For other clients, all performs better in flow 1 than in flow 2 for low overload, and bursts every 9 seconds. This situation changes for high overload with bursts every 1 second, where all executions for all the clients from flow 2 perform better than those in flow 1.
Analysing SLAs for flow 1 (low overload), clients C1, C2 and C4 comply with the SLAs for response time. The client C3 was about 2 seconds above the SLA on average and client C5 was above some few tenths of a second with respect to the SLA on average. Whith a high overload, it is possible to observe that for flow 1, all clients do not respected the SLA and the delay in delivering the results varies greatly according to the SLA signed by each client.
Regarding the SLAs for flow 2 with low overload, only clients C1 and C3 can meet the SLA, with worse performance in this situation compared to flow 1. To high overload, the delay in response delivery is proportionally shorter than in the flow 1, and considering a scenario of high overload, flow 2 has better performance for the response time than flow 1.
In Fig 11 the costs for SLAs of Web services contracted by each of the five clients are presented. As in experiment 1, both two flows can meet the SLA contracts, and again, the flow 1 has the lowest cost in relation to flow 2.
In Fig 12 reputations for SLAs of Web services contracted by each of five clients are presented. Regarding reputation it is possible to observe that in both flows, SLAs contracts are respected also achieving very similar values for both cases.
For experiment 2, it was very difficult to make the analysis of factors effects for the following reasons:
- There are 5 levels in the factor types of client, and the calculation of the factors effects is possible only isolating levels 2 by 2. Therefore it was decided to present only some combinations of the factors effects. The combinations used were (C1 to C2), (C1 to C3) and (C3 to C2).
- Since variation of the load is very high, in most calculations, it was the only factor which influenced the outcome of the experiment. Therefore we decide to isolate the load on the analysis of the influence of factors. So two results are presented for the influence of factors for each combination: one for low load and the other for high load.
In Fig 13 results are presented with the percentage that the factor flow and type of client have influenced the results. In Fig 13 the effect of client’s type C1 and C2 are calculated alone. In Graph (a) the results are presented where the requests were triggered in bursts every 1 second and (b) bursts every 9 seconds.
For the factor effects presented in the Graph (a) the factor type of client influenced 84% and the flow factor influenced 16%; the interaction between the two factors did not influence these results. In Graph (b) in a situation of low overload on the system, the scenario has completely reversed. In this case, the flow was the most important factor involved, reaching 85% of influence, while the factor type of client influenced 7%. The interaction of the two factors, influenced in 8% for this situation.
In Fig 14 the influences of the factors for clients C1 and C3 are presented isolated. When analysing the influence of the factors for these clients, we observed that the factors effects had a different behaviour compared with the factor effects presented in Fig 13.
Graph (a) from the Fig 14 shows the factors effects for the high overload and it indicates that the flow factor has an influence of 51%, the client factor is 27% and the interaction between these two factors is 22%. In Graph (b) of Fig 14, the influence of the factors is reversed in this case, the type of client factor influenced in 52%, the flow factor influenced 6% and the interaction of factors influenced in 42%.
In the Graph (a) of the Fig 15, where there is a high overload, the factor type of client influenced in 67%, the factor type of client influenced 0%, but the interaction of the two factors had an influence of 33%. In the Graph (b) the factor effects are presented in low overload. In this case the factor flow influenced 0%, the factor type of client influenced 31% in the results and the interaction of the two factors influenced 69%.
Fig 16 shows the influence of the factors for clients (a) C1 and C2, (b) C1 and C3, and (c) C2 and C3, for the response variable cost.
In Graph (a) of Fig 16, the influence of factors presented in these results suggests that the flow factor influenced by 80%, the client factor 18% and the interaction between the two factors 2%. In the Graph (b) of Fig 16, the flow factor influenced 54%, the client factor influenced 46% and the interaction of factors influenced in almost 0%. In Graph (c), again the factor that most influenced the result was the flow with 60%, the client factor influenced 27% and the interaction of factors influenced 4%.
In Fig 17 are shown the factor effects for clients (a) C1 and C2, (b) C1 and C3, and (c) C2 and C3, whereas the response variable reputation.
In Graph (a) of the Fig 17, the effect for the type of client factor influenced in almost 100%, and the client and the interaction between the two factors is almost 0%. In Graph (b) of the Fig 17, the client factor influenced by 98% on the result, the flow factor influenced 1% and the interaction of factors influenced 1%. In Graph (c), the factor that most influenced the result was the type of client with 83%, the flow factor influenced 14% and the interaction of factors influenced 3%.
A good choice of approach for Web services composition can be a crucial issue for better user satisfaction, thus increasing the chances of success in using Automatic Composition of Web services. The choice may vary according to the environment where it will be implemented, so it is important to have a system where you can test the possible approaches for Web services composition before putting them into production.
In this paper we proposed a system named AWSCS in which is possible to evaluate approaches for automatic composition of Web services based on QoS parameters that depend on the execution to be measured.
In the experiments presented in this paper, we demonstrated how unpredictable is the behaviour of executing composite Web services. This is especially true when using a scenario where the load, composition type and client type undergoes changes.
The prototype presented in this paper is a functional version of AWSCS, however there is still much work to be done to progress the AWSCS to make it even more user-friendly tool.
Among the proposed improvements for future work some can be highlighted. For example, the implementation of algorithms for automatic composition of Web services, having the system a complete environment for automatic composition of Web services, from planning the flow of composition to executing the flow. But most crucially we will provide the opportunity to plug composition algorithms into the tool, allowing users to compare the compositions their tools achieve.
Another improvement is to create a repository of Web services. There is a project named OWLS-TC , that offers a collection of semantic definitions for testing, however, implementations of Web services do not exist. Therefore, there is a need to create a repository where, besides the semantic definitions, there are implementations for testing Web services.
With the fault tolerance system proposed in . Integrated with the Broker system, it will be possible to measure the impact of the failure to access the Web services running on the composite Web service.
Finally, we are planning to implement security policies in the system and evaluate the impacts of these policies on Web services. The development of AWSCS system did not contemplate any aspect of safety in the first version of its prototype. This is a very important consideration, given that Web services are often executed using the Internet as infrastructure.
We thank Coordination of Improvement of Personal Higher Education (CAPES), and National Counsel of Technological and Scientific Development (CNPq) and São Paulo Research Fundation (FAPESP, processes 11/09524-7, 13/26420-6, 11/12670-5, 09/16055-3), for the support of this research. We also thank ICMC-USP and LaSDPC for offering the necessary equipments for this study. Some of this work was conducted while Stephan Reiff-Marganiec was on study leave from the University of Leicester.
Conceived and designed the experiments: BTK RHCS SRM MJS. Performed the experiments: BTK JCE LH. Nunes EMO. Analyzed the data: BTK RHCS SRM MJS JCE LH. Nunes EMO CHGF LH. Nakamura. Contributed reagents/materials/analysis tools: BTK JCE RHCS MJS. Wrote the paper: BTK RHCS SRM MJS JCE LH. Nunes EMO CHGF LH. Nakamura.
- 1. Milanovic N, Malek M (2004) Current solutions for web service composition. Internet Computing, IEEE 8: 51–59.
- 2. Lu J, Yu Y, Roy D, Saha D (2007) Web service composition: A reality check. In: Web Information Systems Engineering–WISE 2007, Springer. pp. 523–532.
- 3. Lecue F, Mehandjiev N (2011) Seeking quality of web service composition in a semantic dimension. Knowledge and Data Engineering, IEEE Transactions on 23: 942–959.
- 4. Jordan D, Evdemon J, Alves A, Arkin A, Askary S, Barreto C, et al. (2007) Web services business process execution language version 2.0. OASIS Standard 11.
- 5. Rao J, Su X (2005) A survey of automated web service composition methods. In: Semantic Web Services and Web Process Composition, Springer. pp. 43–54.
- 6. Dustdar S, Schreiner W (2005) A survey on web services composition. Int J Web Grid Serv 1: 1–30.
- 7. Paolucci M, Kawamura T, Payne TR, Sycara K (2002) Semantic matching of web services capabilities. In: The Semantic Web—ISWC 2002, Springer. pp. 333–347.
- 8. Yang Y, Zheng W, Liu S, Li X (2012) A hybrid matchmaking algorithm for semantic web service. In: Computer and Information Technology (CIT), 2012 IEEE 12th International Conference on. IEEE, pp. 147–151.
- 9. Zhi-Hao Z, Shi Y (2008) Rdf4s based semantic web service matchmaking framework. In: Semantic Computing and Systems, 2008. WSCS’08. IEEE International Workshop on. IEEE, pp. 95–100.
- 10. Wei D, Wang T, Wang J, Bernstein A (2011) Sawsdl-imatcher: A customizable and effective semantic web service matchmaker. Web Semantics: Science, Services and Agents on the World Wide Web 9: 402–417.
- 11. Pop CB, Chifu VR, Salomie I, Dinsoreanu M (2010) Immune-inspired method for selecting the optimal solution in web service composition. In: Resource Discovery, Springer. pp. 1–17.
- 12. Prazeres CVS, Teixeira CAC, Pimentel MdGC (2009) Semantic web services discovery and composition: paths along workflows. In: Web Services, 2009. ECOWS’09. Seventh IEEE European Conference on. IEEE, pp. 58–65.
- 13. Hatzi O, Vrakas D, Nikolaidou M, Bassiliades N, Anagnostopoulos D, Vlahavas I (2012) An integrated approach to automated semantic web service composition through planning. Services Computing, IEEE Transactions on 5: 319–332.
- 14. Li W, Guo W (2008) Semantic-based web service matchmaking algorithm in biomedicine. In: BioMedical Engineering and Informatics, 2008. BMEI 2008. International Conference on. volume 1, pp. 648–652.
- 15. Lin-feng S, Yong Q (2010) A novel end-user oriented service composition model based on quotient space theory. In: Service Sciences (ICSS), 2010 International Conference on. IEEE, pp. 180–184.
- 16. He Y, Zhao L, Wu Z, Li F (2008) Modeling web services composition with transaction extension for performance evaluation. In: Asia-Pacific Services Computing Conference, 2008. APSCC ’08. IEEE. pp. 476–481.
- 17. Fang X, Zhang J, Yin Z (2010) A study on the dynamic web service composition based on stochastic petri net. In: Web Information Systems and Mining (WISM), 2010 International Conference on. volume 1, pp. 113–117.
- 18. Jing S, Yu-yue D (2010) Performance analysis of web service composition based on stochastic well-formed workflow. In: Networked Computing (INC), 2010 6th International Conference on. pp. 1–5.
- 19. Juan S, Hao W (2012) Performance analysis for web service composition based on queueing petri net. In: Software Engineering and Service Science (ICSESS), 2012 IEEE 3rd International Conference on. pp. 501–504.
- 20. Yu Y, Ma H, Zhang M (2013) An adaptive genetic programming approach to qos-aware web services composition. In: Evolutionary Computation (CEC), 2013 IEEE Congress on. pp. 1740–1747.
- 21. Yu HQ, Reiff-Marganiec S (2009) A backwards composition context based service selection approach for service composition. In: Services Computing, 2009. SCC’09. IEEE International Conference on. IEEE, pp. 419–426.
- 22. Puttonen J, Lobov A, Martinez Lastra J (2013) Semantics-based composition of factory automation processes encapsulated by web services. Industrial Informatics, IEEE Transactions on 9: 2349–2359.
- 23. Zou G, Lu Q, Chen Y, Huang R, Xu Y, Xiang Y (2014) Qos-aware dynamic composition of web services using numerical temporal planning. Services Computing, IEEE Transactions on 7: 18–31.
- 24. Estrella JC, Santana RHC, Santana MJ (2011) WSARCH: An Architecture for Web Services Provisioning with QoS Support: Performance Challenges. VDM Verlag Dr. Müller.
- 25. Nunes L, Vasconcelos Nakamura L, Tardiole Kuehne B, de Oliveira E, De O Libardi R, Junqueira Adami L, et al. (2014) Peesos: A web tool for planning and execution of experiments in service oriented systems. In: Web Services (ICWS), 2014 IEEE International Conference on. pp. 606–613.
- 26. Taher L, Basha R, El Khatib H (2005) Establishing association between qos properties in service oriented architecture. In: Next Generation Web Services Practices, 2005. NWeSP 2005. International Conference on. IEEE, pp. 6–pp.
- 27. Grønmo R, Jaeger MC (2005) Model-driven methodology for building qos-optimised web service compositions. In: Distributed Applications and Interoperable Systems. Springer, pp. 68–82.
- 28. Paoli F, Lulli G, Maurino A (2006) Design of Quality-Based Composite Web Services, volume 4294 of Lecture Notes in Computer Science. Springer Berlin Heidelberg, 153–164 pp.
- 29. Cardellini V, Casalicchio E, Grassi V, Lo Presti F (2007) Flow-based service selection forweb service composition supporting multiple qos classes. In: Web Services, 2007. ICWS 2007. IEEE International Conference on. pp. 743–750.
- 30. Jain R (1991) The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling. Wiley.
- 31. Klusch M, Kapahnke P, Fries B, Alam Khalid M, Vasileski M (2010). Owl-s service retrieval test collection. version 4.0. URL http://projects.semwebcentral.org/projects/owls-tc/.
- 32. Oliveira E, Estrella J, Tardiole Kuehne B, Machado Leite Filho D, Junqueira Adami L, Nunes L, et al. (2014) Design and implementation of fault tolerance techniques to improve qos in soa. In: Network and Service Management (CNSM), 2014 10th International Conference on. pp. 37–45.