Papers › Genetic-based fog colony optimization hybridized with hierarchical clustering and its...
Genetic-based fog colony optimization hybridized with hierarchical clustering and its influence in the placement of fog services
Francisco Talavera, Isaac Lera, Carlos Juiz, Carlos Guerrero
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The organization of fog devices into fog colonies has reduced the complexity management of fog domains. One of the main influencing factors on this complexity is the large number of devices, i.e. the high scale level of the infrastructure. Fog colonies are subsets of fog devices that are managed independently from the other colonies. Thus, the number of devices involved in the management of a colony is much smaller. Previous studies have evaluated the influence of the fog colony layout on system performance metrics. We propose to use a hierarchical clustering as the base definition of the fog colony layout of the fog infrastructure. The dendrogram obtained from this hierarchical clustering includes all the colony candidates. A genetic algorithm is in charge of selecting the subset of colony candidates that optimizes the two performance metrics under study: the network communication time between users and applications, and the execution time of the algorithms that manage internally the placement of the applications in each colony. We implemented the NSGA-II, a common multi-objective approach for GAs, to evaluate our proposal. The results show that a meta-heuristic such as a GA improves the performance metrics by defining the fog colony layout through the use of the dendrogram. Nine different experiment scenarios, varying the number of applications and fog devices, were studied. In the worst of the cases, 137 generations were enough to the results of the GA dominated the solutions obtained with two control algorithms. The number of genetic solutions and their homogeneous distribution in the Pareto front were also satisfactory.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections