A two-level patching scheme for video multicast

Although patching has shown to be a simple and efficient technique for immediate media on-demand delivery, there is still much scope for further improvement compared with the lower bound of the server network-O bandwidth requirement. In this paper, a new concept of two-level patching channel is proposed for the first time, based on which patching channels are rearranged through merging and further patching and a novel channel schedule scheme is developed. Simulation results show that the proposed Two-level patching scheme outperforms the conventional patching technique by a significant margin. It even performs better than the Dynamic Skyscraper Algorithm over a wide range of client request rates. Furthermore, it is reasonably competitive with hierarchical multicast stream merging (HMSM) at low to modest client request rates. Most importantly, the implementation complexity of our algorithm is much lower than the Skyscraper and HMSM.