Video multicast based on estimation of consumed average server bandwidth

All the previous patching schemes assume the receive-two model (a client receives two streams simultaneously). The proposed scheme in this paper is the first no attempt receive-three model (a client receives three streams simultaneously) for patching. We patch the streams based on estimation of the average consumed server bandwidth. Simulation results show that the proposed 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. Most importantly, the implementation complexity of our algorithm is much lower than the skyscraper and hierarchical multicast stream merging (HMSM).