Dispersed Computing Resource Discovery Model and Algorithm for Polymorphic Migration Network Architecture

Abstract

Dynamic resource discovery in a network of dispersed computing resources is an open problem. The establishment and maintenance of resource pool information are critical, which involves both the polymorphic migration of the network and the time and energy costs resulting from node selection and frequent interactions of information between nodes. The resource discovery problem for dispersed computing can be considered a dynamic multi-level decision problem. A bi-level programming model of dispersed computing resource discovery 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 structure of resource discovery, and the lower-level model is to explore an effective discovery mode. Complex network topology features are used for the first time to analyze the polymorphic migration characteristics of resource discovery networks. We propose an integrated calibration method for energy consumption parameters based on two discovery modes (i.e., agent mode and self-directed mode). A symmetric trust region based heuristic algorithm is proposed for solving the system model. The numerical simulation 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 algorithm.