Data Layout Method Based on Node Centrality and Hotness
With the rapid development of 5G and big data,the demand for fast and persistent storage of massive data poses a great chal-lenge to storage equipment and network performance.The emergence of information-center networks and technologies such as edge stor-age enables data to be stored near the edge of the network,which reduces the data transmission delay.However,long-term data storage at the edge of the network will inevitably lead to the problem of insufficient node space at the edge,forcing the data to be transmitted to a more distant place and reducing the storage efficiency.To address the above problems,a data layout method based on node centrality and hotness is proposed in the paper,which utilizes the idle time of nodes to migrate data from high space load nodes to low space load nodes,ensuring space surplus for nodes with high heat at the edges.The experimental results show that compared with the storage lay-out schemes such as random and consistent Hash,after a long-term storage task,the method reduces the transmission overhead when storing data in the presence of a relative lack of edge space,reducing the data writing time by more than 30％.
万方数据
维普
