A recursive-prime-factorization-splitting broadcasting protocol for popular videos

This paper presents a novel recursive-prime-factorization-splitting broadcasting protocol for popular videos. Consider a film S divided into n equal parts (S₁, S₂,..., S_n) and played via k channels. Given an integer parameter c, each segment S_i must appear at least once every i+c-1 segments rather than i segments. The value of parameter c means that the users must wait the time of c segments. Each channel of k channels is first partitioned into subchannels by a heuristic strategy. Then, a greedy approach is applied to assign the n segments to k channels. The channel-splitting strategy for assigning one segment to a subchannel is recursive-prime-factorization-splitting. The waiting time is c times the duration of one segment. As a result, the proposed method outperforms the previous broadcasting methods in terms of the maximum waiting time, for the same number of channels.