Share Email Print
cover

Proceedings Paper

Designing a scalable video-on-demand server with data sharing
Author(s): Hyeran Lim; David H. C. Du
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

As current disk space and transfer speed increase, the bandwidth between a server and its disks has become critical for video-on-demand (VOD) services. Our VOD server consists of several hosts sharing data on disks through a ring-based network. Data sharing provided by the spatial-reuse ring network between servers and disks not only increases the utilization towards full bandwidth but also improves the availability of videos. Striping and replication methods are introduced in order to improve the efficiency of our VOD server system as well as the availability of videos. We consider tow kinds of resources of a VOD server system. Given a representative access profile, our intention is to propose an algorithm to find an initial condition, place videos on disks in the system successfully. If any copy of a video cannot be placed due to lack of resources, more servers/disks are added. When all videos are place on the disks by our algorithm, the final configuration is determined with indicator of how tolerable it is against the fluctuation in demand of videos. Considering it is a NP-hard problem, our algorithm generates the final configuration with O(M log M) at best, where M is the number of movies.

Paper Details

Date Published: 1 January 2001
PDF: 12 pages
Proc. SPIE 4315, Storage and Retrieval for Media Databases 2001, (1 January 2001); doi: 10.1117/12.410971
Show Author Affiliations
Hyeran Lim, Univ. of Minnesota/Twin Cities (United States)
David H. C. Du, Univ. of Minnesota/Twin Cities (United States)


Published in SPIE Proceedings Vol. 4315:
Storage and Retrieval for Media Databases 2001
Minerva M. Yeung; Chung-Sheng Li; Rainer W. Lienhart, Editor(s)

© SPIE. Terms of Use
Back to Top