Video File Allocation over Disk Arrays for Video-On-Demand

نویسندگان

  • Yuewei Wang
  • Jonathan C. L. Liu
  • David Hung-Chang Du
  • Jenwei Hsieh
چکیده

Yuewei Wang, Jonathan C.L. Liu, David H.C. Du1 and Jenwei Hsieh Distributed Multimedia Research Center2 & Department of Computer Science, University of Minnesota fywang,cliu,du,[email protected] Abstract A Video-on-Demand (VOD) server needs to store hundreds of movie titles and to support thousands of concurrent accesses. We de ne access pro le as the number of concurrent accesses to each movie title that should be supported by a VOD server. A current highend magnetic disk array (disk) can only support tens of MPEG-2 concurrent accesses, and it is necessary to replicate and/or stripe the hot movie les over multiple disk arrays. How to replicate, stripe, and place the movie les over a minimum number of magnetic disk arrays such that a given access pro le can be supported is an important problem. In this paper, we formulate and solve this problem. The result of this study can be applied to the design of the storage subsystem of a VOD server to economically minimize the cost or to maximize the utilization of disk arrays.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

File Allocation over Disk Arrays forVideo - On -

A Video-on-Demand (VOD) server needs to store hundreds of movie titles and to support thousands of concurrent accesses. This, technically and economically, imposes a great challenge on the design of the disk storage subsystem of a VOD server. Due to diierent demands for diierent movie titles, the numbers of concurrent accesses to diierent movie titles can diier a lot. We deene access proole as ...

متن کامل

Eecient Video Allocation for Video-on-demand Services

A Video-on-Demand (VOD) server needs to store hundreds of movie titles and to support thousands of concurrent accesses. This, technically and economically, imposes a great challenge on the design of the disk storage subsystem of a VOD server. Due to diierent demands for diierent movie titles, the numbers of concurrent accesses to each movie can diier a lot. We deene access proole as the number ...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

Block Allocation in Video Servers for Availability and Throughput

ii Abstract Video servers aimed at the home market must deliver very large files at a low cost. The video files must be shared and reused to contain costs. The nature of videos, however, demand a low jitter (late block delivery) rate. Normal systems tolerate disk queues and deliver, typically, smaller objects in a less predictable manner. This paper explores in a multi disk, stripped, enviornme...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996