Cloud service selection based on weighted KD tree nearest neighbor search

Wenhao Bi, Junwen Ma, Xudong Zhu, Weixiang Wang, An Zhang

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

The military organization cloud cooperation is a new type of military organization that encapsulates combat resources into services and makes them available as a service. Because of the heterogeneity of the combat resources, the cloud services are different not only in functional properties, but also in non-functional properties. Hence, the idea of cloud service selection, which aims at providing service requester with cloud services that meet their needs for non-functional attributes, has emerged. To this end, this paper proposes a cloud service selection method based on the weighted KD tree nearest neighbor search (WKDTNNS) algorithm for the personalized search of cloud services with different weights in each dimension. Firstly, for the atomic cloud service selection, the KD tree of all atomic cloud services with the quality of service (QoS) as the key is constructed, and WKDTNNS is used to match cloud services for service requests from users. Then, for combined cloud service selection, the KD tree is constructed based on pre-established combined cloud services to select several similar services as seeds, and the WKDTNNS algorithm is applied to optimize the seeds and obtain the final results. Finally, a case study is presented to show the feasibility and effectiveness of the proposed method, the results show that the proposed method could achieve better results than other algorithms, with 26%–56% less computation time.

Original languageEnglish
Article number109780
JournalApplied Soft Computing
Volume131
DOIs
StatePublished - Dec 2022

Keywords

  • Cloud service
  • KD tree
  • Nearest neighbor search
  • Service selection

Fingerprint

Dive into the research topics of 'Cloud service selection based on weighted KD tree nearest neighbor search'. Together they form a unique fingerprint.

Cite this