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 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.

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.

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.

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

2011 ◽  
Vol 6 (3) ◽  
pp. 57-74 ◽  
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.

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

2017 ◽  
Vol 6 (3) ◽  
pp. 179 ◽  
Author(s):  
El-Alami Ayoub ◽  
Hair Abdellatif
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Service Selection ◽  
Web Service Composition ◽  
Web Service Selection ◽  
Concrete Service ◽  
The Web ◽  
Selection Of

<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>

QoS BASED SELECTION ALGORITHMS FOR COMPOSITE DISTRIBUTED WEB SERVICES

2009 ◽  
Vol 10 (04) ◽  
pp. 421-434 ◽  
Author(s):  
ABDULMOTALEB EL SADDIK ◽  
DEYANG LIU
Keyword(s):  
Web Services ◽  
Cost Function ◽  
Web Service ◽  
Service Selection ◽  
Function Concept ◽  
Composite Service ◽  
Service Community ◽  
Web Service Selection ◽  
Selection Framework ◽  
Selection Algorithms

We propose a web service selection framework by introducing a QoS-based cost function concept. We used this mechanism to choose a few web services from a given service community according to their cost function. Then, we compose them together to find the optimal composite service. The proposed selection algorithms consume only limited system resources and have the characteristics of efficiency, dynamics, and fault tolerance. Hence, the aim is to optimally select component services at run time according to users' preferences and non-functional parameters.

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.

Sign in / Sign up

Export Citation Format

Share Document