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

2021 ◽  
Author(s):  
Kian Farsandaj

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.

2021 ◽  
Author(s):  
Kian Farsandaj

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.


2012 ◽  
Vol 433-440 ◽  
pp. 1762-1765
Author(s):  
Li Qun Cui ◽  
Cui Cui Li

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.


Author(s):  
El-Alami Ayoub ◽  
Hair Abdellatif

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


2016 ◽  
pp. 204-220
Author(s):  
Zakaria Maamar ◽  
Noura Faci ◽  
Ejub Kajan ◽  
Emir Ugljanin

As part of our ongoing work on social-intensive Web services, also referred to as social Web services, different types of networks that connect them together are developed. These networks include collaboration, substitution, and competition, and permit the addressing of specific issues related to Web service use such as composition, discovery, and high-availability. “Social” is embraced because of the similarities of situations that Web services run into at run time with situations that people experience daily. Indeed, Web services compete, collaborate, and substitute. This is typical to what people do. This chapter sheds light on some criteria that support Web service selection of a certain network to sign up over another. These criteria are driven by the security means that each network deploys to ensure the safety and privacy of its members from potential attacks. When a Web service signs up in a network, it becomes exposed to both the authority of the network and the existing members in the network as well. These two can check and alter the Web service's credentials, which may jeopardize its reputation and correctness levels.


Author(s):  
Bassam Al Shargabi ◽  
Osama Al-haj Hassan ◽  
Alia Sabri ◽  
Asim El Sheikh

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.


2021 ◽  
Author(s):  
Shilpi Verma

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.


2021 ◽  
Author(s):  
Shilpi Verma

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.


Author(s):  
Bassam Al Shargabi ◽  
Osama Al-haj Hassan ◽  
Alia Sabri ◽  
Asim El Sheikh

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.


Author(s):  
Zakaria Maamar ◽  
Noura Faci ◽  
Ejub Kajan ◽  
Emir Ugljanin

As part of our ongoing work on social-intensive Web services, also referred to as social Web services, different types of networks that connect them together are developed. These networks include collaboration, substitution, and competition, and permit the addressing of specific issues related to Web service use such as composition, discovery, and high-availability. “Social” is embraced because of the similarities of situations that Web services run into at run time with situations that people experience daily. Indeed, Web services compete, collaborate, and substitute. This is typical to what people do. This chapter sheds light on some criteria that support Web service selection of a certain network to sign up over another. These criteria are driven by the security means that each network deploys to ensure the safety and privacy of its members from potential attacks. When a Web service signs up in a network, it becomes exposed to both the authority of the network and the existing members in the network as well. These two can check and alter the Web service's credentials, which may jeopardize its reputation and correctness levels.


Author(s):  
Mithilesh Pandey ◽  
Sunita Jalal ◽  
Chetan Singh Negi ◽  
Dharmendra Kumar Yadav

Due to the increasing number of Web Services with the same functionality, selecting a Web Service that best serves the needs of the Web Client has become a tremendously challenging task. Present approaches use non-functional parameters of the Web Services but they do not consider any preprocessing of the set of functionally Similar Web Services. The lack of preprocessing results in increased use of computational resources due to unnecessary processing of Web Services that have a very low to no chance of satisfying the consumer’s requirements. In this paper, we propose an Ensemble classification method for preprocessing and a Web Service Selection method based on the Quality of Service (QoS) parameters. Once the most eligible Web Services are enumerated through classification, they are ranked using the Technique of Order Preference by Similarity to Ideal Solution (TOPSIS) method with Analytic Hierarchy Process (AHP) used for weight calculation. A prototype of the method is developed, and experiments are conducted on a real-world Web Services dataset. Results demonstrate the feasibility of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document