Short Video List Reshuffling for Minimized Wireless Resources through Video Multicast

The explosive development of short video applications has brought severe pressure on radio resources at hotspot areas. The features of short video recommendations-and-pushing techniques provide us an opportunity to relieve the radio resource pressure via wireless multicast: An edge server can be deployed at the base station, which receives short video lists recommended by remote video server and then pushes such mobile video services to local users through wireless multicast. In this paper, we study how to reshuffle the video lists received from remote server so as to facilitate wireless multicast to maximally reduce the required wireless resource while considering the fact that a user client can only buffer one short video for watching based on off-the-shelf short video APPs. We formulate the problem of video list reshuffling for minimizing the total wireless resources consumption as an integer programming problem. We design a Minimum degree of Freedom based Maximum Filling video reshuffling algorithm (MFMF) to address this problem. MFMF moves videos from the original video lists into same sized but reshuffled video lists in a greedy manner, once for a video, whose moving can satisfy the most reshuffled video lists, and if multiple such choices exist, selects the one having the least position options. This process continues until all the videos are moved. We deduce the computation complexity of MFMF. Numerical results demonstrate the significantly high performance of MFMF.