Research on the Web Service Selection with Constraints Based on QoS

2013 ◽  
Vol 717 ◽  
pp. 726-731
Author(s):  
Sheng Jun Qin ◽  
Wei Li

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.

2012 ◽  
Vol 487 ◽  
pp. 357-364
Author(s):  
Xin Jun Li

In the paper, 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. First, we identify the impact of various structural aspects of the composition in terms of the performance and outcomes of the composition. Then, an algorithm is proposed which can reduce the computing time and makes sure better quality of the services selection at the same time by examining a very tiny fraction of the solution space.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.


Author(s):  
Pierluigi Plebani ◽  
Filippo Ramoni

The chapter introduces a quality of Web service model which can be exploited by a Web service broker during the Web service selection phase. The model considers both user and provider standpoints. On the one hand, providers express their capabilities with respect to measurable dimensions (e.g., response time, latency). On the other hand, users can define the requirements with a higher level of abstraction (e.g. performance). Since the quality is subjective by definition, the presented quality model also maps the user preferences, i.e., how much a quality dimension is more important than another one in evaluating the overall quality. The Analytic Hierarchy Approach (AHP) has been adopted as a technique for expressing user preferences. The chapter also describes how the model can be exploited in the Web service selection process. Starting from a set of functionally equivalent Web services, the selection process identifies which are the Web services able to satisfy the user requirements. Moreover, according to a cost-benefit analysis, the list of selected Web services is sorted and, as a consequence, the best Web service is identified.


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.


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.


Author(s):  
Sandeep Kumar ◽  
Kuldeep Kumar

Semantic Web service selection is considered as the one of the most important aspects of semantic web service composition process. The Quality of Service (QoS) and cognitive parameters can be a good basis for this selection process. In this paper, we have presented a hybrid selection model for the selection of Semantic Web services based on their QoS and cognitive parameters. The presented model provides a new approach of measuring the QoS parameters in an accurate way and provides a completely novel and formalized measurement of different cognitive parameters.


Author(s):  
Polska Olga ◽  
◽  
Kudermetov Ravil ◽  
Shkarupylo Vadym ◽  
◽  
...  

This paper is devoted to applying the LSP method for Web service selection based on quality characteristics and the user’s preferences. The purpose of this work is to develop an approach for the Web service selection, which, based on a reasonable choice of Web service quality attributes and the use of the LSP method, allows for a deeper consideration of consumer preferences. The efficiency the LSP method for QoS-based Web service selection is conformed. The novelty of this work is that the LSP method was fully used for QoS-based Web service selection in comparison to the publications authors are aware of. Keywords: Web service, quality attributes, LSP method, aggregation framework, multicriteria decision-making method.


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.


Sign in / Sign up

Export Citation Format

Share Document