A cloud service composition method using a trust-based clustering algorithm and honeybee mating optimization algorithm

作     者：Zanbouri, Kouros Jafari Navimipour, Nima 

作者机构：Islamic Azad Univ Tabriz Branch Dept Comp Engn Tabriz Iran 

出 版 物：《INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS》 (国际通信系统杂志)

年 卷 期：2020年第33卷第5期

页      面：e4259-e4259页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 

主　　题：cloud computing service composition honeybee mating optimization algorithm trust clustering algorithm computing time 

摘      要：One of the most critical issues in using service-oriented technologies is the combination of services, which has become an important challenge in the present. There are some significant challenges in the service composition, most notable is the quality of service (QoS), which is more challenging due to changing circumstances in dynamic service environments. Also, trust value in the case of selection of more reliable services is another challenge in the service composition. Due to NP-hard complexity of service composition, many metaheuristic algorithms have been used so far. Therefore, in this paper, the honeybee mating optimization algorithm as one of the powerful metaheuristic algorithms is used for achieving the desired goals. To improve the QoS, inspirations from the mating stages of the honeybee, the interactions between honeybees and queen bee mating and the selection of the new queen from the relevant optimization algorithm have been used. To address the trust challenge, a trust-based clustering algorithm has also been used. The simulation results using C# language have shown that the proposed method in small scale problem acts better than particle swarm optimization algorithm, genetic algorithm, and discrete gbest-guided artificial bee colony algorithm. With the clustering and reduction of the search space, the response time is improved;also, more trusted services are selected. The results of the simulation on a large-scale problem have indicated that the proposed method is exhibited worse performance than the average results of previous works in computation time.