Web Service Selection Research Articles

QoS-aware web service selection based on self-organising migrating algorithm and fuzzy dominance

Web service composition consists of creating a new complex web service by combining existing ones. The selection of composite services is a very complex and challenging task, especially with the increasing number of services offering the same functionality. The web service selection can be considered as a combinatorial problem which focuses on delivering the optimal composition that satisfies the user's requirements (functional and non-functional needs). Several optimisation algorithms have been proposed in the literature to tackle the web service selection. In this work, we propose an approach that adapts a recent stochastic optimisation algorithm called self-organising migrating algorithm (SOMA) for QoS web service selection problem. Furthermore, we propose a fuzzification of the Pareto dominance and use it to improve SOMA by comparing the services within the local search. The proposed approach is applicable to any combinatorial workflow with parallel, choice and loop pattern. We test our algorithm with a set of synthetic datasets and compare it to the most recently used algorithm (PSO). The comparative study shows that SOMA produces promising results, and therefore, it is able to select the user's composition in an efficient manner.

A Customer-Centric Trust Evaluation Model for Personalized Service Selection

Trust is a very important criterion when service customers select desired Web services from a cluster of Web services with the same function. Most existing trust models cannot effectively implement personalized service selection with regard to consumer preferences and expectations. This paper designs a novel trust management method based on peer-to-peer network and presents a customer-centric trust evaluation model for personalized service selection. The trust evaluation model firstly maintains consumer-to-consumer trust values that are calculated according to preference similarity between customers, secondly gathers ratings on services submitted by other consumers, then synthesizes customer-to-customer trust and these ratings to generate personalized consumer-to-service trust, and finally selects the desired services according to the expected trust levels presented by customers. This paper conducts some experiments to demonstrate the details of service selection. Experimental results show that this model has good applicability to implement personalized service selection. The proposed model well simulates the reality.

Research on Robust Model for Web Service Selection

Abstract Most existing service quality models use defined Quality of Service parameters for service selection.Since a large number of uncertainties exist, the QoS performance indicators in the runtime of the composite services obtained through the model and method based on the determined QoS will be worse even beyond the range acceptable to the users. Web services can solve this problem and become the most reasonable solution in the current application environment. Web services can solve this problem and become the most reasonable solution in the current application environment. In the process of actual service delivery, the key to the failure of the service composition to meet the requirements is caused by uncertain factors. In order to solve the above problems, this paper first proposes a local optimal selection model based on uncertain QoS. The Web service selection method based on uncertain QoS has been progressing in recent years. Second, in order to reduce the time spent on selection, a redundant service selection result is given. The experimental results on the data set show that the proposed model and method can effectively select more robust services for users.

Trust Based Quality Awareness Using Combinatorial Auction Web Service Selection In Service Based Systems

With the immense growth and development of the computing exemplar in service-based systems (SBS), the establishment of the engineering architectures has taken new standards. The computation of trust parameter has become vital and essential to measure the quality of services in such service-based systems. This becomes critical and challenging to the success of multi-tier cloud services. Various approaches have been put forth using the quality aware selection mechanisms, but reliability is a major issue in such systems. In order to establish a more reliable service-based systems, the concept of trust awareness is proposed in the present research work and trust-based quality aware selection using combinatorial auction for service oriented systems is presented. Simulation analysis show that the trust-based quality aware service selection scheme provide better accuracy, high success rate, less cost and reduced overhead than the normal combinatorial auction service selection schemes.

Comparative study of skyline algorithms for selecting Web Services based on QoS

Nowadays, Web Services has become one of the hot issues in the area of computer sciences, that makes an ability to collect capabilities and components in a unique interface to fulfill the user’s requirements. Sometimes, two or more services can be found in available list of services; therefore, there should be a possibility for selecting the best services from discovered list which can satisfy the user’s needs. The selected services should optimize the overall QoS of the composed application, while satisfying all the constraints specified by the consumer on individual QoS parameters. In this paper, we propose a contrast analysis between two Skyline algorithms and evaluate them experimentally.

An architecture based on computing with words to support runtime reconfiguration decisions of service-based systems

Service-based systems (SBSs) need to be reconfigured when there is evidence that the selected Web services configurations no further satisfy the specifications models and, thus the decision-related models will need to be updated accordingly. However, such updates need to be performed at the right pace. On the one hand, if the updates are not quickly enough, the reconfigurations that are required may not be detected due to the obsolescence of the specification models used at runtime, which were specified at design-time. On the other hand, the other extreme is to promote premature reconfiguration decisions that are based on models that may be highly sensitive to environmental fluctuations and which may affect the stability of these systems. To deal with the required trade-offs of this situation, this paper proposes the use of linguistic decision-making (LDM) models to represent specification models of SBSs and a dynamic computing-with-words (CWW) architecture to dynamically assess the models by using a multi-period multi-attribute decision making (MP-MADM) approach. The proposed solution allows systems under dynamic environments to offer improved system stability by better managing the trade-off between the potential obsolescence of the specification models, and the required dynamic sensitivity and update of these models.

ISAT: An intelligent Web service selection approach for improving reliability via two-phase decisions

Due to stochasticity and uncertainty of malicious Web services over the Internet, it becomes difficult to select reliable services while meeting non-functional requirements in service-oriented systems. To avoid the unreliable real-world process of obtaining services, this paper proposes a novel service selection approach via two-phase decisions for enhancing the reliability of service-oriented systems. In the first-phase decision, we define the problem of finding reliable service candidates as a multiple criteria decision making (MCDM) problem. Then, we construct a decision model to address the problem. In the second-phase decision, we define the problem of selecting services based on non-functional requirements as an optimization problem. Finally, we propose a convex hull based approach for solving the optimization problem. Large-scale and real-world experiments are conducted to show the advantages of the proposed approach. The evaluation results confirm that our approach achieves higher success rate and less computation time to guarantee the reliability when compared to the other state-of-the-art approaches.

Web service selection based on response time based on QOS

Choosing an ideal web benefit among a summary of practically proportional web benefits is still a test problem. For the benefits of the Internet, the proximity of low performing servers, high inactivity or the general poor quality of the administration can turn into lost business, disappointment of the client and lost clients. Existing framework in view of Hidden Markov Models, which also proposes an ideal form for the execution of customer demands. Just calculate the reaction time. In this endeavor we propose three different calculations Ant Colony (- based) Optimization, hereditary calculation and Analytic Algorithm. The method we display may be used to compute and anticipate the behavior of internet services in phrases of costs, accessibility and reaction time could be used to classify administrations quantitatively instead of simply subjectively. Against the rationalization calculation of the province used to organize the reaction time. Hereditary calculation used to distinguish the specific cost of the web benefit and the research calculation used to verify the accessibility of web services. It shows the accessibility and manageability of our strategy by extracting probes of genuine information. The outcomes have proven how our proposed technique can allow the client to consistently choose almost all reliable Web To benefit from considering some measurements, among them, the consistency of the frame and the inconsistency of the reaction time.

Service oriented product lines - managed service level agreements for better quality of service

Service Oriented Architecture (SOA) is being used for developing service oriented applications as a set of business specific web services and gives more flexibility for the software development industry. However, systematic reusability for developing applications to fit customers' individual needs with high customization is significant to increase the productivity and reusability of such service oriented applications. Software Product Line (SPL) has the ability to prepare core sets of assets in an identifiable and reusable manner with manageable variable components. Thus, the combination of SOA and SPL has highlighted the term of Service Oriented Product Line (SOPL), which is used for increasing levels of flexibility and reusability. It helps to develop semantics of variability over identified service components. Likewise, Quality of Service (QoS) attributes play an important role in selection of web services in a SOA environment. Service Level Agreements (SLAs) provide the mechanism with a specification of the verifiable Quality attributes in web services. In this paper, we present our implementation approach of SOPL to manage Service Level Agreements (SLAs) in SOPL environments by monitoring Quality of Service (QoS) attributes in bundles of web service components. The design and development of service bundles for representing core sets of assets in SOPL are followed by the initial feature based analysis and identification of service components. The management of SLAs is handled by detecting the deviation between actual and acceptable predefined QoS metrics values in previously analysed web service components via Web Service Level Agreement (WSLA) language specified templates. The case study based evaluation results indicate the usefulness of research contribution.

An Agent Architecture for Qos-Based Web Service Composition Using the Skyline Algorithm

<p>Web service composition is a concept based on the built of an abstract process, by combining multiple existing class instances, where during the execution, each service class is replaced by a concrete service, selected from several web service candidates. This approach has as an advantage generating flexible and low coupling applications, based on its conception on many elementary modules available on the web. The process of service selection during the composition is based on several axes, one of these axes is the QoS-based web service selection. The Qos or Quality of Service represent a set of parameters that characterize the non-functional web service aspect (execution time, cost, etc...). The composition of web services based on Qos, is the process which allows the selection of the web services that fulfill the user need, based on its qualities. Selected services should optimize the global QoS of the composed process, while satisfying all the constraints specified by the client in all QoS parameters. In this paper, we propose an approach based on the concept of agent system and Skyline approach to effectively select services for composition, and reducing the number of candidate services to be generated and considered in treatment. To evaluate our approach experimentally, we use a several random datasets of services with random values of qualities.</p>

An Advanced QoS-Based Web Service Selection Approach

QoS-based web service selection is an important aspect for achieving efficient operations for web service systems. The aim of web service selection is to select an appropriate concrete web service with the best quality of service (QoS) for each abstract web service in a workflow. One way to resolve this problem is to calculate the Pareto optimal solutions which have the better QoS values for some QoS attributes while having at least equivalent values for others. Although a lot of approaches can do that, they do not guarantee the result precision or have prohibitively large overhead. In this paper, we present an Advanced A-Fully Polynomial Time Approximation Scheme (A2-FPTAS) by the unequal local error bound to balance the precision and the overhead. Experimental results are presented to show the efficiency of this approach.

Towards an efficient and a more accurate web service selection using MCDM methods

Nowadays, due to the fast growth of the number of web services with the same functionalities, the selection of the best services becomes a tricky task. Therefore, to provide a more powerful selection tool, web services are now additionally distinguished with respect to their non-functional aspects, especially to Quality of Service (QoS) requirements. Indeed, using QoS perspective in web service selection can help to promote the best candidate web services among those holding the same functional requirements. Hitherto, various QoS based web service selection approaches have been explored in the literature. However, two main challenging and conflicting issues are still demanding a specific attention, namely how accurate is the selection and what is the cost of such a process? In this paper, we target Multi Criteria Decision Making (MCDM) methods to select web services. Within this context, we propose a hybrid method to select the optimal web services based on MCDM. First of all, we use the Skyline method to reduce the research space by removing the dominated web services. Then, the BWM (Best Worst Method) is applied to normalize the weights associated with the QoS parameters according to the user request requirements. To rank the non-dominated web services with respect to the weights normalization, we explore the use of four different MCDM approaches that enjoy an affordable complexity, which are: VIKOR, SAW, TOPSIS and COPRAS. For the sake of a comparison, each method is first tested separately in order to assess its ability to select the optimal elements. Then, in order to provide the best compromise between the different ranking methods, we apply the Borda voting method to determine the compromise solution. Hence, we are able to measure the accuracy of each technique relatively to the Borda solution by applying a similarity function. The implementation and the simulation of the different methods have permitted to assess their performances in terms of time execution and accuracy. The results show clearly that MCDM ranking methods are more likely to diverge in selecting the best elements when the number of web services is increased. This finding argues for the pertinence of computing the Borda solution in the context of MCDM based web service selection.

The Method of Web Service Selection Based on Extended WSDL

The Method of Web Service Selection Based on Extended WSDL

Enhanced Artificial Bee Colony Algorithm for QoS-aware Web Service Selection problem

Web Service Composition aims to select and aggregate many web services to generate a workflow. The workflow contains many tasks and for each task there are many web services to choose from. The challenge is to select the best combination of web services that achieve the user requirements. This problem is called Web Service Selection (WSS). In this work, we improve on the Artificial Bee Colony Algorithm to make it more suitable for the WSS problem. Our proposed enhancement controls the exploitation and exploration strategies in such a way that encourages exploration at early stages and exploitation at later stages. Our experiments indicate that our algorithm finds better solutions and reduces the execution time compared with other algorithms.

QoS-Based Architecture for Discovery and Selection of suitable Web Services Using Non-functional properties

QoS-Based Architecture for Discovery and Selection of suitable Web Services Using Non-functional properties

Multi-Objective Optimization Model for QoS-Enabled Web Service Selection in Service-Based Systems

ABSTRACTNowadays, the web service has become the emerging communication technology where the interaction of each user is performed through the World Wide Web. However, the performance of the web service mechanism is degraded due to security flaws that occur throughout the Internet.. The user or service requester may not attain the relevant web service for their requirement. To overcome this problem, the newly developed multi-objective based Cuckoo Search (MCS) algorithm is proposed in this article. Initially, the input query model was built by the query keyword that is provided by the service requester. Then, the given query is matched with the database that hosts the web services that relates to input query. Among the various services, the user has to select the appropriate web service using the proposed algorithm. The MCS algorithm is newly designed by combining the Cuckoo Search algorithm and the QoS parameter based multiple objectives. Additionally, the new mathematical model of fitness is evaluated by the multi-objective parameters. Finally, the proposed algorithm exploits the fitness value to select the relevant web service for the user query. The experimental results are validated and performance is analyzed by the parameters of precision, recall, and F-measure. Thus, 86.6% of precision value was obtained by the proposed method, which ensured provision of the appropriate web service.

An Approach to Web Services Selection for Multiple Users

Web service selection for multiple users is an important aspect for achieving efficient operations for web service applications. Its aim is to select optimal solutions, in which each abstract web service in the workflow of a web application is bound to its corresponding concrete web service with the optimal quality of service (QoS), for all users based on their QoS requirements for the workflow. There are a lot of approaches to resolve this problem, but they do not consider each user’s different QoS requirements or have prohibitively large overhead for using these approaches. In this paper, we present an approach to significantly improve the efficiency of web service selection by the advanced a-fully polynomial time approximation scheme to calculate the Pareto optimal set, where each solution is not dominated by others. Additionally, this approach reduces its overhead further by adopting artificial bee colony algorithm to select an optimal solution from the Pareto set for each user. Experimental results are presented to show the efficiency of this approach.

Ontology-based web services classification for registration and discovery of web services

Web services become increasingly important in the world of internet. Thus, users need to access and effectively share web services. The centralised UDDI is a less robust structure and does not support a large number of web services. If the distributed environment is introduced into the UDDI, there will be a rapid increase in services with minimisation of resource consumption. Accordingly, mechanisms are needed for efficient selection of the appropriate instance of the web service in terms of factors like quality and performance. Distribution mechanisms, clustering and classification are necessary for efficient selection of the appropriate web service to the customer needs. In this paper, we propose a shared repository (ontology) which is produced by clustering of web services. This ontology can be exploited by the UDDI for publishing and discovering web services. A matching algorithm is also proposed to show how to perform this operation. A prototype tool has been developed to support experiments that have been carried out to evaluate and show the efficiency of our matching algorithm. We also introduce a comparative analysis to show the effectiveness of our approach compared to existing works.

Ontology-based web services classification for registration and discovery of web services

Web services become increasingly important in the world of internet. Thus, users need to access and effectively share web services. The centralised UDDI is a less robust structure and does not support a large number of web services. If the distributed environment is introduced into the UDDI, there will be a rapid increase in services with minimisation of resource consumption. Accordingly, mechanisms are needed for efficient selection of the appropriate instance of the web service in terms of factors like quality and performance. Distribution mechanisms, clustering and classification are necessary for efficient selection of the appropriate web service to the customer needs. In this paper, we propose a shared repository (ontology) which is produced by clustering of web services. This ontology can be exploited by the UDDI for publishing and discovering web services. A matching algorithm is also proposed to show how to perform this operation. A prototype tool has been developed to support experiments that have been carried out to evaluate and show the efficiency of our matching algorithm. We also introduce a comparative analysis to show the effectiveness of our approach compared to existing works.

Optimal Web Service Selection Based On Network Distance and Web Service Performance

The last decade has witnessed a tremendous growth of web services. web services are enabling organizations to use web as a market for selling their own web services. Nevertheless, it becomes more difficult to find the most appropriate web service that satisfies users’ functional and non-functional requirements. Most of the former works in web service selection treat the QoS values as constants. However, QoS values of a service as perceived by a given user are intrinsically random. Proposed method mentioned is a novel approach to select the optimal web service considering response time and network latency using Hidden Markov Model.