A Trust-Aware Search Engine for Complex Service Computing

2014 ◽  
Vol 11 (1) ◽  
pp. 57-75 ◽  
Author(s):  
Mingdong Tang ◽  
Zibin Zheng ◽  
Liang Chen ◽  
Jianxun Liu ◽  
Buqing Cao ◽  
...  
Keyword(s):  
Web Service ◽  
Search Engine ◽  
Service Selection ◽  
Mobile Internet ◽  
Enabling Technology ◽  
Computing Environment ◽  
Business Partners ◽  
Service Computing ◽  
Qos Evaluation

Service computing has become a key-enabling technology to support collaboration and interaction among business partners and customers. With the development of new emerging service-related computing paradigms such as Cloud Computing and Mobile Internet, more and more services are provided by different providers. These services are becoming increasingly complex. Aiming at recommending high-quality and trustful services in the complex service computing environment, this paper presents a trust-aware search engine by integrating service functionalities, QoS (quality of service) and service trust. The proposed search engine primarily contains four components: keyword-based service matching, service QoS evaluation, service reputation evaluation and a hybrid ranking method which combines the results yielded by the previous three components to produce final service recommendations. To evaluate the performance of the authors' service search engine, comprehensive experiments are conducted using a real Web service dataset. The experimental results show that our approach outperforms conventional QoS-based service selection methods. Finally, a prototype is also presented to validate the authors' trust-aware Web service search engine.

Multi-criteria Web Services Selection: Balancing the Quality of Design and Quality of Service

2022 ◽  
Vol 22 (1) ◽  
pp. 1-31
Author(s):  
Marwa Daaji ◽  
Ali Ouni ◽  
Mohamed Mohsen Gammoudi ◽  
Salah Bouktif ◽  
Mohamed Wiem Mkaouer
Keyword(s):  
Quality Of Service ◽  
Web Services ◽  
Web Service ◽  
State Of The Art ◽  
Service Selection ◽  
Service Design ◽  
Design Quality ◽  
Trade Off ◽  
Selection Approach

Web service composition allows developers to create applications via reusing available services that are interoperable to each other. The process of selecting relevant Web services for a composite service satisfying the developer requirements is commonly acknowledged to be hard and challenging, especially with the exponentially increasing number of available Web services on the Internet. The majority of existing approaches on Web Services Selection are merely based on the Quality of Service (QoS) as a basic criterion to guide the selection process. However, existing approaches tend to ignore the service design quality, which plays a crucial role in discovering, understanding, and reusing service functionalities. Indeed, poorly designed Web service interfaces result in service anti-patterns, which are symptoms of bad design and implementation practices. The existence of anti-pattern instances in Web service interfaces typically complicates their reuse in real-world service-based systems and may lead to several maintenance and evolution problems. To address this issue, we introduce a new approach based on the Multi-Objective and Optimization on the basis of Ratio Analysis method (MOORA) as a multi-criteria decision making (MCDM) method to select Web services based on a combination of their (1) QoS attributes and (2) QoS design. The proposed approach aims to help developers to maintain the soundness and quality of their service composite development processes. We conduct a quantitative and qualitative empirical study to evaluate our approach on a Quality of Web Service dataset. We compare our MOORA-based approach against four commonly used MCDM methods as well as a recent state-of-the-art Web service selection approach. The obtained results show that our approach outperforms state-of-the-art approaches by significantly improving the service selection quality of top- k selected services while providing the best trade-off between both service design quality and desired QoS values. Furthermore, we conducted a qualitative evaluation with developers. The obtained results provide evidence that our approach generates a good trade-off for what developers need regarding both QoS and quality of design. Our selection approach was evaluated as “relevant” from developers point of view, in improving the service selection task with an average score of 3.93, compared to an average of 2.62 for the traditional QoS-based approach.

scholarly journals A Cluster-Based Browsing Model For QoS-Aware Web Service Selection

2021 ◽  
Author(s):  
Kian Farsandaj
Keyword(s):  
Web Services ◽  
Web Service ◽  
Clustering Algorithm ◽  
Service Selection ◽  
Functional Requirements ◽  
Analysis Techniques ◽  
Symbolic Data ◽  
Web Service Selection ◽  
The Web

In the last decade, selecting suitable web services based on users’ requirements has become one of the major subjects in the web service domain. Any research works have been done - either based on functional requirements, or focusing more on Quality of Service (QoS) - based selection. We believe that searching is not the only way to implement the selection. Selection could also be done by browsing, or by a combination of searching and browsing. In this thesis, we propose a browsing method based on the Scatter/Gather model, which helps users gain a better understanding of the QoS value distribution of the web services and locate their desired services. Because the Scatter/Gather model uses cluster analysis techniques and web service QoS data is best represented as a vector of intervals, or more generically a vector of symbolic data, we apply for symbolic clustering algorithm and implement different variations of the Scatter/Gather model. Through our experiments on both synthetic and real datasets, we identify the most efficient ( based on the processing time) and effective implementations.

QoS-Based Extensible Selection Framework for Web Service

2012 ◽  
Vol 433-440 ◽  
pp. 1762-1765
Author(s):  
Li Qun Cui ◽  
Cui Cui Li
Keyword(s):  
Web Services ◽  
Web Service ◽  
Functional Properties ◽  
Service Providers ◽  
Rapid Development ◽  
Service Selection ◽  
Functional Requirements ◽  
Web Service Selection ◽  
Selection Framework

With the rapid development of Web services technology, more and more Web services emerged in the network. Service consumer attached importance to the functional properties of services, also more and more emphasis on non-functional properties, namely Quality of Service. The Ultimate goal is meet consumer the demand of QoS. Therefore, service providers paid more and more attention to quality of services to meets the needs of users. This takes into account the options to meet the functional requirements and the QoS requirements, and designed a Web service selection framework. At the same time, QoS attributes can be added or deleted the number, so it is an extendible framework. The results show that the framework could select the appropriate service for users.

scholarly journals Performance Evaluation of Quality of Service (QoS) based Web Service Selection Methods for Healthcare Product Shopping Domain Using Analysis of Variance (ANOVA)

2021 ◽  
Author(s):  
Maheswari S ◽  
Pitchai R ◽  
Supraja P ◽  
Babu S
Keyword(s):  
Quality Of Service ◽  
Web Service ◽  
Analysis Of Variance ◽  
Service Selection ◽  
Fuzzy Topsis ◽  
Selection Methods ◽  
Healthcare Product ◽  
Web Service Selection ◽  
Using Data

Abstract Guaranteeing Quality of Service (QoS) concerning web administrations is the capacity to respond to the necessities and comprehend the prerequisites according to the tendencies of a client. It is resolved subject to the non-practical properties of the web administrations. Dependent upon the conditions, administrations clients may have an extent of tendencies for the non utilitarian principles. This made a way for different QoS based web administrations assurance segments which along these lines require an evaluation plot for grasping a particular methodology. Investigation of change is a particular kind of verifiable hypothesis testing used for making decisions using data. The goal of the paper is to dismember the plans specifically Analytical Hierarchical preparing (AHP), Logical Scoring Preference (LSP) and Fuzzy Topsis reliant on extent of customer tendency norms and investigate them using Analysis of Variance (ANOVA). QWS dataset has been used for exploring recently referenced three plans. Preliminary outcomes show that the Fuzzy Topsis contrive beats the other web organization assurance techniques.

Quality-of-Service Based Web Service Composition and Execution Framework

2014 ◽  
pp. 74-93
Author(s):  
Bassam Al Shargabi ◽  
Osama Al-haj Hassan ◽  
Alia Sabri ◽  
Asim El Sheikh
Keyword(s):  
Quality Of Service ◽  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Service Selection ◽  
Web Service Composition ◽  
Web Service Selection ◽  
Selection Decisions ◽  
Uddi Registry

Software is gradually becoming more built by composing web services to support enterprise applications integration; thus, making the process of composing web services a significant topic. The Quality of Service (QoS) in web service composition plays a crucial role. As such, it is important to guarantee, monitor, and enforce QoS and ability to handle failures during execution. Therefore, an urgent need exists for a dynamic Web Service Composition and Execution (WSCE) framework based on QoS constraints. A WSCE broker is designed to maintain the following function: intelligent web service selection decisions based on local QoS for individual web service or global QoS based selection for composed web services, execution tracking, and adaptation. A QoS certifier controlled by the UDDI registry is proposed to verify the claimed QoS attributes. The authors evaluate the composition plan along with performance time analysis.

WS-SIM: A Toolkit for Modeling and Simulation of Service Composition

2013 ◽  
Vol 756-759 ◽  
pp. 1304-1308
Author(s):  
Fan Zhang
Keyword(s):  
Web Service ◽  
Service Composition ◽  
Simulation Experiment ◽  
Service Selection ◽  
Selection Algorithm ◽  
Web Service Selection ◽  
Composite Services ◽  
Selection Algorithms

Web service has been rapidly developed in recent years. Web service selection is an important issue in web service composition and lots of service selection algorithms have been presented. As lots of them select an atomic service during runtime, it is not an easy task to evaluate the quality of the composited service which composed of several atomic services. In this work we introduce WS-SIM, a simulation toolkit, to solve this problem. WS-SIM supports modeling and simulating composite services and atomic services in the real world. This system also provides many common service selection algorithms and researchers can custom their own service selection algorithm for a simulation experiment. The quality of composite services can also be generated by our system. Furthermore, to demonstrate suitability of the WS-SIM, in this paper, functionalities of our system are illustrated by a case study. This confirms the usability and the applicability of WS-SIM.

scholarly journals Web service selection based on response time based on QOS

2017 ◽  
Vol 7 (1.1) ◽  
pp. 278
Author(s):  
T. Vijaya Saradhi ◽  
Sk. Ayesha Muskan ◽  
K. Janaki Ram ◽  
T. Praveen Kumar
Keyword(s):  
Reaction Time ◽  
Web Service ◽  
Test Problem ◽  
Markov Models ◽  
Hidden Markov ◽  
Service Selection ◽  
Poor Quality ◽  
Web Service Selection ◽  
Almost All

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.

scholarly journals A Cluster-Based Browsing Model For QoS-Aware Web Service Selection

2021 ◽  
Author(s):  
Kian Farsandaj
Keyword(s):  
Web Services ◽  
Web Service ◽  
Clustering Algorithm ◽  
Service Selection ◽  
Functional Requirements ◽  
Analysis Techniques ◽  
Symbolic Data ◽  
Web Service Selection ◽  
The Web

In the last decade, selecting suitable web services based on users’ requirements has become one of the major subjects in the web service domain. Any research works have been done - either based on functional requirements, or focusing more on Quality of Service (QoS) - based selection. We believe that searching is not the only way to implement the selection. Selection could also be done by browsing, or by a combination of searching and browsing. In this thesis, we propose a browsing method based on the Scatter/Gather model, which helps users gain a better understanding of the QoS value distribution of the web services and locate their desired services. Because the Scatter/Gather model uses cluster analysis techniques and web service QoS data is best represented as a vector of intervals, or more generically a vector of symbolic data, we apply for symbolic clustering algorithm and implement different variations of the Scatter/Gather model. Through our experiments on both synthetic and real datasets, we identify the most efficient ( based on the processing time) and effective implementations.

Sign in / Sign up

Export Citation Format

Share Document