Answers are grounded in this paper and cite their sources.
This paper presents a novel data management approach for efficient data search and movement in a Distributed Knowledge Graph (DKG) within the Edge-Fog-Cloud continuum. The aim is to minimize data traffic and query time by relocating data closer to where it is needed. We propose a variation of the Ant Colony Optimization algorithm, using pheromone abstraction to identify optimal paths between network nodes. Once established, the algorithm moves data along these paths, evaluating the necessity of each relocation. We evaluate our approach through computer simulations, using query hit rates as the primary metric. We compare hit rates before and after data movement to assess algorithm efficiency. Our findings identify parameters that enhance search efficiency, achieving high hit rates while conserving resources. Future work will involve incorporating realistic network properties and exploring practical implementations.
No takes yet. Share an insight, caveat, or question.
Chepizhko et al. (2025) studied this question.