• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.1
• /
• pp.38-59
• /
• 2022

Web services instances can be classified into two categories, namely trusted and untrusted from users. A web service with high throughput (TP) and low response time (RT) instance values is a trusted web service. Web services are not trustworthy due to the mismatch in the guaranteed instance values and the actual values achieved by users. To perform web services selection from users' attained TP and RT values, we need to verify the correct prediction of trusted and untrusted instances from invoked web services. This accurate prediction of web services instances is used to perform the selection of web services. We propose to construct fuzzy rules to label web services instances correctly. This paper presents web services selection using a well-known machine learning algorithm, namely REPTree, for the correct prediction of trusted and untrusted instances. Performance comparison of REPTree with five machine learning models is conducted on web services datasets. We have performed experiments on web services datasets using a ten k-fold cross-validation method. To evaluate the performance of the REPTree classifier, we used accuracy metrics (Sensitivity and Specificity). Experimental results showed that web service (WS1) gained top selection score with the (47.0588%) trusted instances, and web service (WS2) was selected the least with (25.00%) trusted instances. Evaluation results of the proposed web services selection approach were found as (asymptotic sig. = 0.019), demonstrating the relationship between final selection and recommended trust score of web services.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.586-589
• /
• 2012

Web Services have been utilized in a wide variety of applications and have turned into a key technology in developing business operations on the Web. Originally, Web Services can be exploited in an isolated form, however when no single Web Service can satisfy the functionality required by a user, there should be a possibility to compose existing services together in order to fulfill the user requirement. However, since the same service may be offered by different providers with different non-functional Quality of Service (QoS), the task of service selection for Web Service composition is becoming complicated. Also, as Web Services are inherently unreliable, how to deliver reliable Web Services composition over unreliable Web Services should be considered while composing Web Services. In this paper, we propose an approach on a QoS-aware Web Service selection for reliable Web Service composition. In our approach, we select and classify Web Services using Decision Tree based on QoS attributes provided by the client. Service classifier will improve selection of relevant Web Services early in the composition process and also provide flexibility to replace a failed Web Services with a redundant alternative Web Services, resulting in high availability and reliability of Web Service composition. We will provide an implementation of our proposed approach along with efficiency measurements through performance evaluation.

• Journal of Information Technology Services
• /
• v.6 no.2
• /
• pp.125-143
• /
• 2007

IT Services market is growing rapidly in the business industry and SOA-based Web Services have been introduced as an effective vehicle for the integration of enterprise-wide applications within organizations. The number of publicly available Web Services is ever increasing recently in a variety of areas, and as the number of public Web Services increases, there will be many Web Services with the same functionality. These services, however, will vary in their QoS properties, such as price, response time and availability, and it is very important to choose a right service while satisfying given QoS constraints. This paper addresses the issue of selecting composite Web Services which involves conditional branches in business processes. It is essential to have any conditional branches satisfy the global QoS constraints at service selection phase, since the branches are chosen to execute at run-time dynamically. We proposed service selection procedures for basic structure of conditional branches and explained them by examples. Experiments were conducted to analyze the impact of the number of candidate services and service types on the time of finding service solutions.

• Journal of KIISE:Software and Applications
• /
• v.36 no.1
• /
• pp.1-9
• /
• 2009

In heterogeneous and distributed computing environments, with an increasing number of Web services providing similar functionalities, the reliability of Web services is a critical decision factor. To fulfill the open business model such as cooperation among enterprises, several Web services can be composed into the upper level business transaction. In Web services composition, the reliability of services is more and more critical. Though each unit Web service can be reliable, the reliability of the composed service is not guaranteed. Thus a way to efficiently assess and select composed Web services is needed. In this paper, we define new metrics for measuring the trust value of Web services, and propose an evaluation method to predict the trustworthy degree of the composed services based on the metrics. We also define a conceptual framework to support optimal Web services selection based on the proposed trust evaluation method. By selecting using the quantitative measurement rather than intuitive selection of the service user, it allows the service users to select the high reliable service meeting their quality requirements well.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1307-1310
• /
• 2009

Web services provide the possibility of dynamically integrating distributed service components scattered over the Internet to fulfill sophisticated business demands. However due to today's wide variety of services offered to perform a specific task, it's essential that users are supported in the eventual selection of appropriate services. An example of web services for which selection of appropriate services will be crucial is Auto Repair Services. Selecting proper service from a variety of Auto Part Shops would be result of delivering high-quality service and minimizing Auto Repair Service customer's waiting time. Therefore, in this research to assist selecting proper service, we present Functional-Level Mediator and illustrate its usage in matching customer's and web service's goals. Five matching cases have been analyzed and results from experiment have been shown. Also, taking advantage of implementing multithreaded web services which reflects concurrent activity in the real world more naturally, we have significantly minimized customer's waiting time at Auto Repair Service.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.7
• /
• pp.1252-1273
• /
• 2011

In Web Service Composition (WSC) area, services selection aims at selecting an appropriate candidate from a set of functionally-equivalent services to execute the function of each task in an abstract WSC according to their different QoS values. In despite of many related works, few of previous studies consider transactional constraints in QoS-aware WSC, which guarantee reliable execution of Composite Web Service (CWS) that is composed by a number of unpredictable web services. In this paper, we propose a novel global selection-optimal approach in WSC by considering both transactional constraints and end-to-end QoS constraints. With this approach, we firstly identify building rules and the reduction method to build layer-based Directed Acyclic Graph (DAG) model which can model transactional relationships among candidate services. As such, the problem of solving global optimal QoS utility with transactional constraints in WSC can be regarded as a problem of solving single-source shortest path in DAG. After that, we present Graph-building algorithms and an optimal selection algorithm to explain the specific execution procedures. Finally, comprehensive experiments are conducted based on a real-world web service QoS dataset. The experimental results show that our approach has better performance over other competing selection approaches on success ratio and efficiency.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.12
• /
• pp.209-218
• /
• 2014

The more mobile devices consuming web services, the more QoS-aware selection of mobile web services, we need. A QoS(Quality of Service) contract is an agreement between the web service provider and the mobile user that specifies the level of the service quality. Web services users can be assured of the level of the service quality specified by the QoS contract. We propose a broker-based framework for QoS-aware mobile web services selection in this work. Under this architecture, the mobile users can request the web services through the service broker on the wireless networks. The service broker utilizes agents to monitor the web services quality and manages the service quality by notifying the service provider and mobile user of the service contract violation. Reliability, response time, and cost were the metrics used for QoS monitoring. Futhermore mobile users can select a web service best suited for his/her needs through the service broker.

• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.431-446
• /
• 2007

Executable composite Web services are selected by binding a given abstract workflow with the specific Web services that satisfy given QoS requirements. Considering the rapidly increasing number of Web services and their highly dynamic QoS environment, the fast selection of composite services is important. This paper presents a method for quality driven comosite Web services selection based on a workflow partition strategy. The proposed method partitions an abstract workflow into two sub-workflows to decrease the number of candidate services that should be considered. The QoS requirement is also decomposed for each partitioned workflow. Since the decomposition of a QoS requirement is based on heuristics, the selection might fail to find composite Web services. To avoid such a failure, the tightness of a QoS requirement is defined and a workflow is determined to be partitioned according to the tightness. A mixed integer linear programming is utilized for the efficient service selection. Experimental results show that the success rate of partitioning is above 99%. Particularly, the proposed method performs faster and selects composite services whose qualities are not significantly different (less than 5%) from the optimal one.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.674-675
• /
• 2010

Since in web service composition, the same service may be offered by different providers with different Quality of Services (QoS) attributes, selection criteria are needed to select which Web Services will be considered for composition. Location of provider can be one of these criteria and intends to decrease the number of remote interactions between providers as well as reducing waiting time of service consumer. Therefore in this paper, we present technique for composing web services according to their location by semantically describing customer's goals and provider's web service capability by means of carefully designed ontology and logical expression.

• The KIPS Transactions:PartD
• /
• v.19D no.4
• /
• pp.299-306
• /
• 2012

To fulfill the complex user requirement, composition web service comprised of existing services is considered from the efficient and reusable point of view instead of making entirely new web service. However, with the growing the number of web services which provide the same functionality but differ in quality value, the service composition becomes a decision problem on which component services should be selected such that end-to-end QoS constraints by the client and overall QoS of the composition service are satisfied. QoS of service aspects is a determinant factor for selecting the services, since the performance of the composed service is determined by the performance of the involved component web service. In this paper, hybrid genetic algorithm is presented to select component services to take part in the QoS-aware composition. The local search method is used to be combined with the genetic algorithm to improve the individuals (component service) in population as well as composed service. The paper also presents a set of experiments conducted to evaluate the efficiency of selection algorithm using the real web service data.