4.6 Article

An Ant Colony Optimization-Based Multiobjective Service Replicas Placement Strategy for Fog Computing

Journal

IEEE TRANSACTIONS ON CYBERNETICS
Volume 51, Issue 11, Pages 5595-5608

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2020.2989309

Keywords

Edge computing; Cloud computing; Computer architecture; Optimization; Internet of Things; Ant colony optimization; Real-time systems; Ant colony optimization (ACO); fog computing; Internet of Things (IoT); multiobjective scheduling; service placement

Funding

  1. Key Area Research and Development Program of Guangdong Province [2020B010164003]
  2. National Natural Science Foundation of China [61872064, 61772205]
  3. Guangzhou Science and Technology Program key projects [201902010040, 201907010001, 202007040002]
  4. Guangzhou Development Zone Science and Technology [2018GH17]
  5. Guangdong Major Project of Basic and Applied Basic Research [2019B030302002]
  6. Fundamental Research Funds for the Central Universities, SCUT [2019ZD26]

Ask authors/readers for more resources

This article investigates the placement of service replicas in fog computing and proposes an ant colony optimization-based solution, MRPACO, which is validated through extensive experiments. The results show that the solutions obtained are qualified in terms of diversity and accuracy, the main evaluation metrics of a multiobjective algorithm.
In recent years, fog computing has emerged as a new paradigm for the future Internet-of-Things (IoT) applications, but at the same time, ensuing new challenges. The geographically vast-distributed architecture in fog computing renders us almost infinite choices in terms of service orchestration. How to properly arrange the service replicas (or service instances) among the nodes remains a critical problem. To be specific, in this article, we investigate a generalized service replicas placement problem that has the potential to be applied to various industrial scenarios. We formulate the problem into a multiobjective model with two scheduling objectives, involving deployment cost and service latency. For problem solving, we propose an ant colony optimization-based solution, called multireplicas Pareto ant colony optimization (MRPACO). We have conducted extensive experiments on MRPACO. The experimental results show that the solutions obtained by our strategy are qualified in terms of both diversity and accuracy, which are the main evaluation metrics of a multiobjective algorithm.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available