scholarly journals Interactive QOS browsing for web service selection

2021 ◽  
Author(s):  
Preethy Sambamoorthy
Keyword(s):  
Web Service ◽  
Data Clustering ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Service Selection ◽  
Numerical Data ◽  
Interval Data ◽  
Distance Measures ◽  
Web Service Selection

In most of the current research works on Quality of Service (QoS) based web service selection, searching is usually the dominant way to find the desired services. This approach comes with the potential problem of framing search queries properly due to requestor's lack of knowledge or vague requirement about QoS attribute values. In this thesis, we propose an interactive QoS browsing mechanism that uses the concept of clustering to present the QoS value distribution to requestors followed by finer views of service quality. By analyzing various QoS attributes, we believe that the symbolic interval data is a proper type of representation, compared with the single valued numerical data. Therefore, we use interval data clustering algorithms to implement our browsing system. We conducted experiments on simulated QoS datasets to compare the performance of using different distance measures and show the effectiveness of the interval data clustering algorithm used. The result of the experiments show that the proposed approach provides an effective, user guided QoS based service selection approach that can conceivably overcome the problems with current approaches.

scholarly journals Interactive QOS browsing for web service selection

2021 ◽  
Author(s):  
Preethy Sambamoorthy
Keyword(s):  
Web Service ◽  
Data Clustering ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Service Selection ◽  
Numerical Data ◽  
Interval Data ◽  
Distance Measures ◽  
Web Service Selection

In most of the current research works on Quality of Service (QoS) based web service selection, searching is usually the dominant way to find the desired services. This approach comes with the potential problem of framing search queries properly due to requestor's lack of knowledge or vague requirement about QoS attribute values. In this thesis, we propose an interactive QoS browsing mechanism that uses the concept of clustering to present the QoS value distribution to requestors followed by finer views of service quality. By analyzing various QoS attributes, we believe that the symbolic interval data is a proper type of representation, compared with the single valued numerical data. Therefore, we use interval data clustering algorithms to implement our browsing system. We conducted experiments on simulated QoS datasets to compare the performance of using different distance measures and show the effectiveness of the interval data clustering algorithm used. The result of the experiments show that the proposed approach provides an effective, user guided QoS based service selection approach that can conceivably overcome the problems with current approaches.

scholarly journals Effective Quality Of Service Browsing For Web Service Selection

2021 ◽  
Author(s):  
Shilpi Verma
Keyword(s):  
Quality Of Service ◽  
Web Services ◽  
Web Service ◽  
User Study ◽  
Clustering Algorithms ◽  
Service Selection ◽  
Interval Data ◽  
Weighted Clustering ◽  
Web Service Selection

The growing number of Services on the Web has made locating desired Web Services a sizable challenge. Web Service requestors deem a Quality of Service (QoS) based Web Service selection important in terms of providing a relevant and user centric service selection experience. In this thesis an interactive QoS based Web Service browsing mechanism is proposed, which makes use of three clustering algorithms including vector-based, preference-based and weighted clustering. We use symbolic interval data as the principle representation of QoS attributes. The browsing mechanism which was implemented as part of this research allows service requestors to prioritize their search by hierarchically clustering their web services. This is done in order of their preferences and also by attaching a weight to each QoS attribute, which is a beneficial compromise between performance-high preference-based clustering and time-efficient vector-based clustering, Along with several extensive experiments, a user study was conducted in order to test the usability of this browsing mechanism and to test the overall efficiency and performance of the three clustering algorithms in comparison. The result of the experiment led to evidences that preference-based browsing approach was the most efficient one when compared to vector-based or weighted clustering approaches.

scholarly journals Effective Quality Of Service Browsing For Web Service Selection

2021 ◽  
Author(s):  
Shilpi Verma
Keyword(s):  
Quality Of Service ◽  
Web Services ◽  
Web Service ◽  
User Study ◽  
Clustering Algorithms ◽  
Service Selection ◽  
Interval Data ◽  
Weighted Clustering ◽  
Web Service Selection

The growing number of Services on the Web has made locating desired Web Services a sizable challenge. Web Service requestors deem a Quality of Service (QoS) based Web Service selection important in terms of providing a relevant and user centric service selection experience. In this thesis an interactive QoS based Web Service browsing mechanism is proposed, which makes use of three clustering algorithms including vector-based, preference-based and weighted clustering. We use symbolic interval data as the principle representation of QoS attributes. The browsing mechanism which was implemented as part of this research allows service requestors to prioritize their search by hierarchically clustering their web services. This is done in order of their preferences and also by attaching a weight to each QoS attribute, which is a beneficial compromise between performance-high preference-based clustering and time-efficient vector-based clustering, Along with several extensive experiments, a user study was conducted in order to test the usability of this browsing mechanism and to test the overall efficiency and performance of the three clustering algorithms in comparison. The result of the experiment led to evidences that preference-based browsing approach was the most efficient one when compared to vector-based or weighted clustering approaches.

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.

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.

Sign in / Sign up

Export Citation Format

Share Document