QoS aware web service selection using orthogonal array learning on fruit fly optimization approach

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Manik Chandra ◽  
Rajdeep Niyogi

Purpose This paper aims to solve the web service selection problem using an efficient meta-heuristic algorithm. The problem of selecting a set of web services from a large-scale service environment (web service repository) while maintaining Quality-of-Service (QoS), is referred to as web service selection (WSS). With the explosive growth of internet services, managing and selecting the proper services (or say web service) has become a pertinent research issue. Design/methodology/approach In this paper, to address WSS problem, the authors propose a new modified fruit fly optimization approach, called orthogonal array-based learning in fruit fly optimizer (OL-FOA). In OL-FOA, they adopt a chaotic map to initialize the population; they add the adaptive DE/best/2mutation operator to improve the exploration capability of the fruit fly approach; and finally, to improve the efficiency of the search process (by reducing the search space), the authors use the orthogonal learning mechanism. Findings To test the efficiency of the proposed approach, a test suite of 2500 web services is chosen from the public repository. To establish the competitiveness of the proposed approach, it compared against four other meta-heuristic approaches (including classical as well as state-of-the-art), namely, fruit fly optimization (FOA), differential evolution (DE), modified artificial bee colony algorithm (mABC) and global-best ABC (GABC). The empirical results show that the proposed approach outperforms its counterparts in terms of response time, latency, availability and reliability. Originality/value In this paper, the authors have developed a population-based novel approach (OL-FOA) for the QoS aware web services selection (WSS). To justify the results, the authors compared against four other meta-heuristic approaches (including classical as well as state-of-the-art), namely, fruit fly optimization (FOA), differential evolution (DE), modified artificial bee colony algorithm (mABC) and global-best ABC (GABC) over the four QoS parameter response time, latency, availability and reliability. The authors found that the approach outperforms overall competitive approaches. To satisfy all objective simultaneously, the authors would like to extend this approach in the frame of multi-objective WSS optimization problem. Further, this is declared that this paper is not submitted to any other journal or under review.

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.


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.


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


2016 ◽  
Vol 20 (6) ◽  
pp. 1319-1344 ◽  
Author(s):  
Martin Garriga ◽  
Alan De Renzis ◽  
Ignacio Lizarralde ◽  
Andres Flores ◽  
Cristian Mateos ◽  
...  

2021 ◽  
Author(s):  
Anita Mohebi

The power of Web services to address the incompatibility issue of standalone systems, has led them to play a major role in business application development. Adopting an efficient and effective method to locate and select desired services among thousands of available candidates is an important task in the service-oriented computing. As part of a Web service discovery system, the ranking process enables users to locate their desired services more effectively. Many of the existing approaches ignore the role of user's requirements which is an important factor in the ranking process. In this thesis we enhance a vector-based ranking method by considering user's requirements. The vector-based model is chosen because of its simplicity and high efficiency. We evaluate all Web services in terms of their similarity degrees to the optimal or the best available values of each quality attribute, and penalize the services that fail to meet the user's requirements. Through our extensive experiments using real datasets, we compare the improved algorithm with other approaches to evaluate it in terms of efficiency (the execution time to return the result) and quality of the results (accuracy). Cherie Ding


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


Sign in / Sign up

Export Citation Format

Share Document