Towards scalable delivery of video streams to heterogeneous receivers

The required real-time and high-rate transfers for multimedia data severely limit the number of requests that can be serviced concurrently by Video-on-Demand (VOD) servers. Resource sharing techniques can be used to address this problem. We study how VOD servers can support heterogeneous receivers while delivering data in a client-pull fashion using enhanced resource sharing. We propose three hybrid solutions. The first solution simply combines existing resource sharing techniques and deals with clients as two bandwidth classes. The other two solutions, however, classify clients into multiple bandwidth classes and service them accordingly by capturing the proposed ideas of Adaptive Stream Merging or Enhanced Adaptive Stream Merging, respectively. We also discuss how scheduling policies can be adapted to the heterogeneous environment so as to exploit the variations in client bandwidth. We evaluate the effectiveness of the proposed solutions and analyze various scheduling policies through extensive simulation.

[1]  Philip S. Yu,et al.  The Maximum Factor Queue Length Batching Scheme for Video-on-Demand Systems , 2001, IEEE Trans. Computers.

[2]  Mary K. Vernon,et al.  Bandwidth skimming: a technique for cost-effective video on demand , 1999, Electronic Imaging.

[3]  Asit Dan,et al.  Scheduling policies for an on-demand video server with batching , 1994, MULTIMEDIA '94.

[4]  Kien A. Hua,et al.  Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems , 1997, SIGCOMM '97.

[5]  Chita R. Das,et al.  Caching and scheduling in NAD-based multimedia servers , 2004, IEEE Transactions on Parallel and Distributed Systems.

[6]  Cheng Huang,et al.  Loss-resilient on-demand media streaming using priority encoding , 2004, MULTIMEDIA '04.

[7]  Efficient cost-based scheduling for scalable media streaming , 2007, Electronic Imaging.

[8]  Mary K. Vernon,et al.  Optimal and efficient merging schedules for video-on-demand servers , 1999, MULTIMEDIA '99.

[9]  Chita R. Das,et al.  A New Class of Scheduling Policies for Providing Time of Service Guarantees in Video-On-Demand Servers , 2004, MMNS.

[10]  Kien A. Hua,et al.  BroadCatch: a periodic broadcast technique for heterogeneous video-on-demand , 2004, IEEE Transactions on Broadcasting.

[11]  Marcelo de Almeida Maia,et al.  Scalable media streaming to interactive users , 2005, MULTIMEDIA '05.

[12]  Mary K. Vernon,et al.  Group-guaranteed channel capacity in multimedia storage servers , 1997, SIGMETRICS '97.

[13]  Donald F. Towsley,et al.  Efficient schemes for broadcasting popular videos , 2002, Multimedia Systems.

[14]  Ann L. Chervenak,et al.  Tertiary Storage: An Evaluation of New Applications , 1994 .

[15]  Asit Dan,et al.  Channel Allocation under Batching and VCR Control in Movie-On-Demand Servers , 1995 .

[16]  Kien A. Hua,et al.  Periodic Broadcast Protocol for Heterogeneous Receivers , 2003, IS&T/SPIE Electronic Imaging.

[17]  Darrell D. E. Long,et al.  Improving video-on-demand server efficiency through stream tapping , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[18]  Donald F. Towsley,et al.  Channel Allocation under Batching and VCR Control in Video-on-Demand Systems , 1995, J. Parallel Distributed Comput..

[19]  Mary K. Vernon,et al.  Minimizing Bandwidth Requirements for On-Demand Data Delivery , 2001, IEEE Trans. Knowl. Data Eng..

[20]  Li-Ming Tseng,et al.  Harmonic broadcasting for video-on-demand service , 1997, IEEE Trans. Broadcast..

[21]  Kien A. Hua,et al.  An efficient bandwidth-sharing technique for true video on demand systems , 1999, MULTIMEDIA '99.