Applications are sets of interacting components that can be executed in sequence, in parallel, or by using more complex constructs such as selections and loops. They can, therefore, be modeled as structured graphs with substructures consisting of these constructs. Fog computing can reduce the latency induced by distant clouds by enabling the deployment of some components at the edge of the network (i.e., closer to end-devices) while keeping others in the cloud. Network Functions Virtualization (NFV) decouples software from hardware and enables an agile deployment of network services and applications as Virtual Network Functions (VNFs). In NFV settings, efficient placement algorithms are required to map the structured graphs representing the VNF Forwarding Graphs (VNF-FGs) onto the infrastructure of the hybrid cloud/fog system. Only deterministic graphs with sequence and parallel substructures have been considered thus to date. However, several real-life applications do require non-deterministic graphs with sub-structures as selections and loops. This paper focuses on application component placement in NFVbased hybrid cloud/fog systems, with the assumption that the graph representing the application is non-deterministic. The objective is to minimize an aggregated weighted function of makespan and cost. The problem is modeled as an Integer Linear Programming (ILP) and evaluated over small-scale scenarios using the CPLEX optimization tool.
Mouradian et al. REF tackle application component placement in NFV-based hybrid Cloud-Edge systems and propose an ILP formulation that represents applications as non-deterministic VNF Forwarding Graphs.
Application Component Placement in NFV-based Hybrid Cloud/Fog Systems
2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)
2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)
Computer Science