Availability-aware Service Placement Policy in Fog Computing Based on Graph Partitions

Abstract

This paper presents a policy for service placement of fog applications inspired on complex networks and graph theory. We propose a twofold partition process based on communities for the partition of the fog devices and based on transitive closures for the application services partition. The allocation of the services is performed sequentially by, firstly, mapping applications to device communities and, secondly, mapping service transitive closures to fog devices in the community. The underlying idea is to place as many inter-related services as possible in the most nearby devices to the users. The optimization objectives are the availability of the applications and the Quality of Service (QoS) of the system, measured as the number of requests that are executed before the application deadlines. We compared our solution with an Integer Linear Programming approach, and the simulation results showed that our proposal obtains higher QoS and availability when fails in the nodes are considered.

References in corpus (4)

• Finding and evaluating community structure in networks
• On Reducing IoT Service Delay via Fog Offloading
• A Method to Find Community Structures Based on Information Centrality
• A lightweight decentralized service placement policy for performance optimization in fog computing

Cited by in corpus (15)

• YAFS: A simulator for IoT scenarios in fog computing
• Evaluation and Efficiency Comparison of Evolutionary Algorithms for Service Placement Optimization in Fog Architectures
• Decentralized Edge-to-Cloud Load-balancing: Service Placement for the Internet of Things
• Placement of Microservices-based IoT Applications in Fog Computing: A Taxonomy and Future Directions
• Application Management in Fog Computing Environments: A Taxonomy, Review and Future Directions
• Digital Twin-Empowered Network Planning for Multi-Tier Computing
• Optimization policy for file replica placement in fog domains
• Multi-objective application placement in fog computing using graph neural network-based reinforcement learning
• Privacy-Aware Load Balancing in Fog Networks: A Reinforcement Learning Approach
• Multilayer Resource-aware Partitioning for Fog Application Placement
• Optimal Service Provisioning in IoT Fog-based Environment for QoS-aware Delay-sensitive Application
• Genetic-based fog colony optimization hybridized with hierarchical clustering and its influence in the placement of fog services
• Optimizing Microservices Placement in the Cloud-to-Edge Continuum: A Comparative Analysis of App and Service Based Approaches
• A Novel Service Deployment Policy in Fog Computing Considering The Degree of Availability and Fog Landscape Utilization Using Multiobjective Evolutionary Algorithms
• A platform for lightweight deployment of IoT applications based on a Function-as-a-Service model