Variable Neighborhood Search and Tabu Search for the Web Service Selection Problem

2012 ◽  
Vol 39 ◽  
pp. 177-184 ◽  
Author(s):  
Nina Turajlić ◽  
Siniša Nešković
Keyword(s):  
Tabu Search ◽  
Web Service ◽  
Variable Neighborhood Search ◽  
Service Selection ◽  
Selection Problem ◽  
Neighborhood Search ◽  
Web Service Selection ◽  
The Web

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.

Social Web Services Management

2016 ◽  
pp. 204-220
Author(s):  
Zakaria Maamar ◽  
Noura Faci ◽  
Ejub Kajan ◽  
Emir Ugljanin
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Use ◽  
Service Selection ◽  
High Availability ◽  
Social Web ◽  
Web Service Selection ◽  
Ongoing Work ◽  
The Web ◽  
Selection Of

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.

Research on the Web Service Selection with Constraints Based on QoS

2013 ◽  
Vol 717 ◽  
pp. 726-731
Author(s):  
Sheng Jun Qin ◽  
Wei Li
Keyword(s):  
Web Service ◽  
Software Design ◽  
Service Selection ◽  
Allocation Scheme ◽  
Web Service Selection ◽  
Availability Constraints ◽  
The One ◽  
Qos Performance ◽  
Reliability And Availability ◽  
The Web

The SOA model brings new benefits to software design and architecture by enabling re-use and sharing of services. Due to the uncertain of web service, it is important to make sure that the selected service is always reliable and available. In this work, we propose an allocation scheme that minimizes the response time and cost of the solution subject to reliability and availability constraints in terms of expected value. The algorithm proposed in this paper aims to discover services with high QoS performance, and reduce the execute time at the same time. Finally, we proves the advantage of the new algorithm by comparing the time obtained by our proposed algorithm with the one achieved by other algorithm.

Applying gravitational search algorithm in the QoS-based Web service selection problem

2011 ◽  
Vol 12 (9) ◽  
pp. 730-742 ◽  
Author(s):  
Bahareh Zibanezhad ◽  
Kamran Zamanifar ◽  
Razieh Sadat Sadjady ◽  
Yousef Rastegari
Keyword(s):  
Web Service ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Service Selection ◽  
Selection Problem ◽  
Web Service Selection ◽  
Gravitational Search
Sign in / Sign up

Export Citation Format

Share Document