Data allocation algorithms for distributed video servers

In this paper, We discuss the server level data allocation problems in the distributed Video-on-Demand systems. We proposed two data allocation algorithms, Bandwidth Weighted Partition (BWP) algorithm and Popularity Based (PB) algorithm, based on the bandwidth and storage capacity limits of the distributed multimedia servers. We compare those two algorithms with the traditional Round Robin (RR) algorithm. The analysis and simulation studies show that PB algorithm is a simple and practical video data allocation algorithm for the distributed video servers. It provides near optimal system performance in any system condition.

[1]  A RoweLawrence,et al.  Hierarchical Storage Management in a Distributed VOD System , 1996 .

[2]  Beng Chin Ooi,et al.  Disk striping strategies for large video-on-demand servers , 1997, MULTIMEDIA '96.

[3]  Shahram Ghandeharizadeh,et al.  Staggered striping in multimedia information systems , 1994, SIGMOD '94.

[4]  Kien A. Hua,et al.  A bandwidth management technique for hierarchical storage in large-scale multimedia servers , 1997, Proceedings of IEEE International Conference on Multimedia Computing and Systems.

[5]  David Hung-Chang Du,et al.  Weighted striping in multimedia servers , 1997, Proceedings of IEEE International Conference on Multimedia Computing and Systems.

[6]  Ernst W. Biersack,et al.  Performance and reliability study for distributed video servers: mirroring or parity? , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

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