首页|Dispersed Computing Resource Discovery Model and Algorithm for Polymorphic Migration Network Architecture
Dispersed Computing Resource Discovery Model and Algorithm for Polymorphic Migration Network Architecture
扫码查看
点击上方二维码区域,可以放大扫码查看
原文链接
NETL
NSTL
万方数据
Dynamic resource discovery in a net-work of dispersed computing resources is an open prob-lem.The establishment and maintenance of resource pool information are critical,which involves both the poly-morphic migration of the network and the time and en-ergy costs resulting from node selection and frequent in-teractions of information between nodes.The resource discovery problem for dispersed computing can be con-sidered a dynamic multi-level decision problem.A bi-level programming model of dispersed computing resource dis-covery is developed,which is driven by time cost,energy consumption and accuracy of information acquisition.The upper-level model is to design a reasonable network struc-ture of resource discovery,and the lower-level model is to explore an effective discovery mode.Complex network to-pology features are used for the first time to analyze the polymorphic migration characteristics of resource discov-ery networks.We propose an integrated calibration meth-od for energy consumption parameters based on two dis-covery modes(i.e.,agent mode and self-directed mode).A symmetric trust region based heuristic algorithm is pro-posed for solving the system model.The numerical simu-lation is performed in a dispersed computing network with multiple modes and topological states,which proves the feasibility of the model and the effectiveness of the al-gorithm.