An efficient algorithm for the video server selection problem

This paper addresses the problem of video server selection in a distributed video-on-demand system. The objective of the problem is to balance the load among video servers and to minimize the delay for the video requests to be served. In order to achieve this objective, a near optimal assignment algorithm is proposed for video server selection. Empirical study shows that our proposed algorithm is able to achieve good load balancing performance as compared to some landmark algorithms.

[1]  Lawrence A. Rowe,et al.  The Berkeley distributed video-on-demand system , 1995, NEC Research Symposium on Multimedia Computing.

[2]  U. Mocci,et al.  Optimal server location in VOD networks , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[3]  Lawrence A. Rowe,et al.  Hierarchical Storage Management in a Distributed VOD System , 1996, IEEE Multim..

[4]  Jeong-dong Ryoo,et al.  Resource Optimization in Video-On-Demand Networks , 1996 .

[5]  Chatschik Bisdikian,et al.  Issues on movie allocation in distributed video-on-demand systems , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[6]  Anup Kumar,et al.  Design and analysis of a video-on-demand server , 1997, Multimedia Systems.