Analysis of Dynamic Resource Adjustment Strategy in Edge Computing
This paper describes various algorithm comparison methods for dynamic resource adjustment.Based on the simulated annealing algorithm,a recent and longest unallocated optimization strategy that can simultaneously balance the load of edge side nodes and initial node selection is proposed.It analyzes experimental testing and algorithm validation.
edge computingdynamic resource allocationload balancingrecent and longest unallocated
NETL
NSTL
万方数据
