scholarly journals Service Discovery and Selection Based on Dynamic QoS in the Internet of Things

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Naiheng Zhang
Keyword(s):  
Service Quality ◽  
Web Service ◽  
Service Discovery ◽  
Hamming Distance ◽  
Service Selection ◽  
Development Trend ◽  
Service Invocation ◽  
Web Service Selection ◽  
Service Portfolio ◽  
The Impact

Web services are self-describing and self-contained modular applications based on the network. With the deepening of web service applications, service consumers have gradually increased their requirements for service functions and service quality. Aiming at how to select the optimal plan from a large number of execution plans with the same function and different QoS characteristics, this paper proposes a web service selection algorithm that supports QoS global optimization and dynamic replanning. The algorithm uses position matrix coding to represent all execution paths and replanning information of the service combination. By calculating the Hamming distance of the service quality between individuals, the quality of the service portfolio is improved. By specifying the total user time limit and implementing a good solution retention strategy, the problem of the impact of algorithm running time on service quality is solved. The experimental results show that the method proposed in this paper is effectively integrated into the development trend of QoS and close to the requester’s needs and can better meet user needs. This algorithm improves the user’s satisfaction with the returned service to a certain extent and improves the efficiency of service invocation.

scholarly journals An Efficient Qos-Based Ranking Model for Web Service Selection with Consideration \of User's Requirement

2021 ◽  
Author(s):  
Anita Mohebi
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Discovery ◽  
High Efficiency ◽  
Service Selection ◽  
Application Development ◽  
Web Service Selection ◽  
Business Application ◽  
Service Oriented

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

THE APPROACH FOR QOS BASED WEB SERVICE SELECTION WITH USER’S PREFERENCES

2020 ◽  
pp. 19-27
Author(s):  
Polska Olga ◽  
◽  
Kudermetov Ravil ◽  
Shkarupylo Vadym ◽  
◽  
...  
Keyword(s):  
Service Quality ◽  
Web Service ◽  
Consumer Preferences ◽  
Service Selection ◽  
Multicriteria Decision Making ◽  
Quality Attributes ◽  
Quality Characteristics ◽  
Web Service Selection ◽  
Reasonable Choice ◽  
The Web

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.

scholarly journals An Efficient Qos-Based Ranking Model for Web Service Selection with Consideration \of User's Requirement

2021 ◽  
Author(s):  
Anita Mohebi
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Discovery ◽  
High Efficiency ◽  
Service Selection ◽  
Application Development ◽  
Web Service Selection ◽  
Business Application ◽  
Service Oriented

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

Dynamic Transaction Aware Web Service Selection

2014 ◽  
Vol 23 (03) ◽  
pp. 1450004 ◽  
Author(s):  
Kanchana Rajaram ◽  
Chitra Babu ◽  
Arun Adiththan
Keyword(s):  
Web Service ◽  
Service Selection ◽  
Dynamic Selection ◽  
Web Service Selection ◽  
Composite Web Service ◽  
Requirements Change ◽  
Selection Approach ◽  
Internet Environment ◽  
Run Time ◽  
The Impact

Web service composition, that recursively constructs a composite web service out of the existing services based on a business workflow has been acknowledged as a promising approach to meet the user demands, whenever a single service alone cannot fulfil the needs. In view of frequent failures in the internet environment where the composed service is executed, reliability of the composed service must be ensured. The reliability is determined by the behavioral or transactional properties of component services. The component services for each activity of the workflow must be selected based on their behavior so that their execution results in a consistent termination. Service selection must happen at run-time in order to consider the services available in a service registry at the time of execution. Towards this need, a dynamic transaction aware web service selection approach is proposed in this paper. Further, whenever user requirements change, a long running transaction must be interrupted and cancelled which is not addressed by any of the existing works. Hence, service cancellability property is proposed in this paper and incorporated in the dynamic selection approach. The overhead of the proposed run-time selection approach is assessed and the impact of increased services on its performance is also measured.

Method of Top-k Web service selection based on QoS

2010 ◽  
Vol 30 (4) ◽  
pp. 872-875
Author(s):  
Hai WANG ◽  
Zheng-dong ZHU ◽  
Zeng-zhi LI
Keyword(s):  
Web Service ◽  
Service Selection ◽  
Web Service Selection
Sign in / Sign up

Export Citation Format

Share Document