A moth‐flame optimization algorithm for web service composition in cloud computing: Simulation and verification

Trans Emerging Tel Tech

Safara

et al. 2019

Self Cite

137

With the rapid development of in modern technologies has led to a novel generation of cyberspace equipment and secure analysis methods such as cyber‐physical system (CPS). The CPS system refers to an intelligent dependable system of embedded smart devices used to monitor and control the cyberspace conditions in a fog computing environment. The fog computing environment connects resources even human beings together to enhance the quality of life through performing of CPS applications using computation resources at the network edge. The optimization of task scheduling for the CSP applications as a challenging issue has been considered as the NP‐hard problem in fog computing environment which is not trivial. On the one hand, reasonable tasks scheduling can increase resource utilization, which can avoid less idle resource. This paper presents a task scheduling algorithm based on moth‐flame optimization algorithm to assign an optimal set of tasks to fog nodes to meet the satisfaction of quality of service requirements of CPS applications in such a way that the total execution time of tasks is minimized. The minimization of task execution and transfer time in the proposed algorithm are considered as objective functions. The experimental testing of the proposed solution is carried out in iFogSim toolkit. As a result of the simulation based on proposed algorithm found, the optimal solution for the scheduling of tasks and equal distribution of tasks to fog nodes has been provided, and less total execution time consumption has been achieved compared with other algorithms.

Section: Preliminary Conceptsmentioning

confidence: 99%

An efficient task scheduling approach using moth‐flame optimization algorithm for cyber‐physical system applications in fog computing

Ghobaei‐Arani

Trans Emerging Tel Tech

Safara

et al. 2019

Self Cite

137

“…Formal methods try to achieve the consistency and stable OpenFlow interactions between the SDN layers . Furthermore, the formal method illustrates the specification and verification of the correctness of a system's behavior using mathematical and logical methods . For analyzing the SDN approaches, the formal verification mechanisms can be very useful to measure the functional and nonfunctional properties (NFPs).…”

Section: Motivation and Related Workmentioning

confidence: 99%

A systematic literature review on formal verification of software‐defined networks

Trans Emerging Tel Tech

Norouzi

Asghari

et al. 2019

Self Cite

By raising evolutionary network connections, a software‐defined network (SDN) offers a well‐managed and flexible novel network topology. The SDN efforts are provided to abstract the original network configuration for business applications and web services. Additionally, the SDN modifies the network management policies such as topology policies, deployment policies, the applicability, and infrastructure maintenance. One of the important features of the SDN is standardizing the network interfaces with the precise functional semantics in application and control flow layers. In another hand, specification and evaluation of the existing network interfaces is a main and significant challenge to prove the correctness of the configurable scenarios in the SDN approach. Recently, formal verification presents a high potential platform to evaluate the main‐layer scenarios of the SDN as the novel perspective in this area. Up to now, there is no survey and state‐of‐the‐art review on the formal verification methods in the SDN. This paper provides a systematic literature review (SLR) for the formal verification methods in the SDN in form of the SDN plans to recognize the state of the art of the open challenges. The presented SLR is classified into three main fields: application plan, data plan, and control plan approaches. The verification mechanisms are compared with each other according to the important factors such as structural properties, quality‐of‐service metrics, applied algorithms, and measurement tools.

“…It is important that a model verifier environment can generate the temporal logic formulas automatically. Due to advantages of model checking approach according to editable design, coding, and without using mathematical proof, some complex reactive and concurrent systems such as IoT, cloud, and SDN can be modeled and analyzed in the model checker tools The state space explosion problem should be optimized to achieve optimal service verification approaches using new modeling techniques such as Kripke transition systems and multilabeled transition systems.…”

Section: Open Issuesmentioning

confidence: 99%

Formal verification approaches in the web service composition: A comprehensive analysis of the current challenges for future research

Rahmani

Navimipour

2018

Int J Communication

Self Cite

Summary Today, service composition is emerging paradigm on the communication networks such as cloud environments, internet of things, wireless sensor network, and software‐defined network. The goal of service composition method is to provide the interactions between user requirements and smart objects of intelligent communication systems. There have been many efforts to use formal verification and behavioral modeling methods to evaluate the service composition mechanisms. Up to now, there is not a comprehensive analysis research on this topic. Therefore, this paper focuses on several formal verification approaches that are performed to confirm the service composition correctness in communication networks. The objective of this paper is to comprehensively categorize and examine current research techniques on formal verification of the service composition. This research analysis provides an overview of recent service composition approaches according to structural and functional properties. Comparison results show that most of the verification approaches in explanation of the service composition correctness are semantic‐aware approach with 43%. The most used verification method for the service composition is model checking with 69%. The process algebra is used 29%, and some theorem proving methods are applied in 9% of the investigated mechanism. Moreover, most widely used modeling tools are NuSMV (22%), SPIN (17%), CPN (12%), UPPAAL (12%), Event‐B (10%), and PAT (5%).