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

Naiheng Zhang,Wei Wang

doi:10.1155/2021/6642514

Abstract

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.

Highlights

With the increasingly widespread and gradual deepening of the Internet of ings applications, massive and heterogeneous Internet of ings devices are constantly pouring into people’s lives [1, 2]
Due to the search and registration of the words used to search for the problem of irrelevant results, the expressions of the service requester and the registrant are consistent, but this method largely limits the flexibility of service search and service registration. rough the use of the Semantic Web, the scope of keywords is expanded, thereby solving the problem of ambiguity in the word keyword and the containment relationship between keywords in the service search process
This keyword-based service matching method is fast, simple, and easy to implement, it often has such a problem: different words may describe the same semantic concept, and the keyword-based service discovery method only works on the same words, and words with different morphology are discarded, which results in a low recall rate; or the same word may have different semantic concepts, and the Complexity keyword-based service discovery method cannot distinguish and identify it

Summary

Introduction

With the increasingly widespread and gradual deepening of the Internet of ings applications, massive and heterogeneous Internet of ings devices are constantly pouring into people’s lives [1, 2]. Rough the use of the Semantic Web, the scope of keywords is expanded, thereby solving the problem of ambiguity in the word keyword and the containment relationship between keywords in the service search process. Web service discovery is to provide users with such technical means, so that users can find services related to their needs [6]. In the process of service discovery and matching, due to the different perspectives of users and service providers, they have completely different understandings of many QoS indicators of services, such as reliability, availability, and security [19,20,21,22]. This paper proposes a web service selection algorithm that supports QoS global optimization and dynamic replanning.

QoS-Aware Key Technologies for Intelligent Acquisition of Web Services

Result evaluation

Objective function

Experimental Verification and Analysis

Conclusion