Feature analysis and performance evaluation of streaming media scheduling algorithms in patching algorithm family

Abstract

The emergence of applications such as VoD system is based on the development of streaming media. The improvement of scheduling algorithms accelerates the transform of streaming media applications from experimental phase to large-scale using. Of all the dynamic scheduling algorithms, the performance of patching algorithm is obviously superior to other dynamic scheduling algorithms. Dynamic scheduling algorithms proposed after patching algorithm are all based on it. These algorithms constitute patching algorithm family. In this paper, we first establish theoretical models to analyze the evolution of three dynamic scheduling algorithms in patching algorithm family. And then we evaluate the performance of these three dynamic scheduling algorithms. Finally, we analyze the scenario of each algorithm.