Edge Caching Node Selection in Short Video Social Network

In order to reduce the delay and bandwidth consumption of content delivery, we investigate how to uncover effective edge nodes in short video social network and cache promotional content or high-quality short video content in them. In this paper, we define the edge caching node selection problem for influence maximization under budget constraint, which proves to be an NP-hard problem. We propose an InfT algorithm based on influence spread tree to uncover edge nodes with high influence capacity in short video social network. During the selection of edge nodes, the cost changes dynamically with the selection of nodes. Experiments on scale-free network show that InfT makes the influence spread of edge caching nodes respectively improve by 21.82%, 438.21%, and 612.04%, when compared to some existing classical algorithms.