The comparative estimation of workload relocation approaches in the fog- and edge-computing environments

In the current paper the issues of the workload relocation in the fog- and edge-computing environments are in-question. The workload relocation problem is closely connected to the scheduling problems, yet, outside the cloud there is almost unlimited number of nodes to place the computational tasks. So the search space for the optimization problem grows, and the time of the workload relocation degrades. We emphasize the techniques to limit the set of candidate nodes for the tasks distribution. In the paper two approaches are proposed and considered in terms of time consumption. The simple models are developed with the following simulation. Also the distributed-ledger-based modifications of the techniques are proposed and examined.