A lightweight decentralized service placement policy for performance optimization in fog computing

Abstract

A decentralized optimization policy for service placement in fog computing is presented. The optimization is addressed to place most popular services as closer to the users as possible. The experimental validation is done in the iFogSim simulator and by comparing our algorithm with the simulator's built-in policy. The simulation is characterized by modeling a microservice-based application for different experiment sizes. Results showed that our decentralized algorithm places most popular services closer to users, improving network usage and service latency of the most requested applications, at the expense of a latency increment for the less requested services and a greater number of service migrations.

References in corpus (4)

• Fog Computing: A Taxonomy, Survey and Future Directions
• Genetic Algorithm for Multi-Objective Optimization of Container Allocation in Cloud Architecture
• Online Placement of Multi-Component Applications in Edge Computing Environments
• Next Generation Cloud Computing: New Trends and Research Directions

Cited by in corpus (9)

• How to Place Your Apps in the Fog -- State of the Art and Open Challenges
• Availability-aware Service Placement Policy in Fog Computing Based on Graph Partitions
• Placement of Microservices-based IoT Applications in Fog Computing: A Taxonomy and Future Directions
• Secure Cloud-Edge Deployments, with Trust
• Application Management in Fog Computing Environments: A Taxonomy, Review and Future Directions
• Optimization policy for file replica placement in fog domains
• Declarative Application Management in the Fog. A bacteria-inspired decentralised approach
• Continuous Reasoning for Managing Next-Gen Distributed Applications
• A platform for lightweight deployment of IoT applications based on a Function-as-a-Service model