A moth‐flame optimization algorithm for web service composition in cloud computing: Simulation and verification. (26th June 2018)

• Record Type: Journal Article
• Authors: Ghobaei‐Arani, Mostafa; Rahmanian, Ali.A; Souri, Alireza; Rahmani, Amir Masoud
• Other Names: Heilig Leonard guestEditor.; Lalla‐Ruiz Eduardo guestEditor.; Voß Stefan guestEditor.; Buyya Rajkumar guestEditor.
• Is Part Of: Software, practice & experience. Volume 48:Number 10(2018)
• Page Start: 1865
• Page End: 1892
• Publication Date: 2018-06-26
• Subjects: cloud computing -- formal verification -- moth‐flame optimization algorithm -- QoS -- web service composition; Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2598
• Languages: English
• ISSNs: 0038-0644

Abstract

Summary: In recent years, users are becoming increasingly accustomed to using the Internet to gain software resources in the form of web services provided by information technology organizations. Cloud computing is a service delivery paradigm that shares services and resources to access the web services to the end users over the Internet. In the cloud environment, based on the user's needs, various types of services with similar functionalities but different quality‐of‐service (QoS) criteria can be delivered, which often must be combined to meet the users' requests. The optimal selection and composition of these services are realized as an interesting issue. In this paper, we propose a moth‐flame optimization (MFO) algorithm, which is a novel nature‐inspired metaheuristic paradigm for the web service composition (WSC) problem called "MFO‐WSC, " to improve the QoS criteria in the distributed cloud environment. Also, formal modeling is presented for the QoS‐aware MFO‐WSC algorithm with the model checking approach that receives the particular benefits to collaborate the correctness of the proposed algorithm. The correctness of the proposed behavior model is examined using some logical problems such as deadlock‐free, fairness, and reachability conditions in the new symbolic model verifier model checker. The experimental results indicate the effectiveness of the proposed algorithm in comparison with similar related works.