Academic
Publications
An Effective Data Placement Scheme to Serve Popular Video On-Demand

An Effective Data Placement Scheme to Serve Popular Video On-Demand,Sangyup Shim,Harish Vedavyasa,David H. C. Du

An Effective Data Placement Scheme to Serve Popular Video On-Demand   (Citations: 8)
BibTex | RIS | RefWorks Download
In this paper, we propose an effective data placement scheme which allocates video data on the disk such that it maximizes concurrent streams that can be supported from the disk. If each user request is served by a separate stream, the number of requests that can be supported is limited due to access constraint on storage. In order to maximize the number of concurrent accesses, requests for a video are accumulated over a predetermined interval, called cycle time, and served together by a stream. A stream is created at every cycle time, and is dedicated to serve a popular video. Each stream retrieves the entire video block by block from the disk and lasts for the duration of the video. Each video stream serves a group of users accumulated over one cycle time. For a pop- ular movie, many video streams are created and this idea is called multi-streaming. These streams are offset by cycle time. Multi-streaming generates a predictable data retrieval pattern. This paper proposes an effective data placement scheme to exploit data retrieval pattern to place data as close as possible on a disk, thus minimizing disk overhead. When a lar ge number of video streams are supported for a popular movie, cycle time becomes small. With small cycle time, VCR functions such as fast-forward can be easily supported by moving from the current stream and the next stream. This paper also introduces what factors of storage are critical for good performance of the multi-streaming scheme.
Cumulative Annual
    • ...Shim et al. [25] intended to alleviate the bandwidth variability problem by taking complementary actions in two identical disks...

    Sheau-ru Tonget al. Efficient Region Layouts for Region-based Video Servers Employing Mult...

    • ...By storing frequently accessed data on the faster zones and less frequently accessed data on the inner zones, one obtains a better throughput statistically [13], [28] when reading data streams...

    Wil Michielset al. On the Guaranteed Throughput of Multizone Disks

    • ...Some other works [Ghan96A, Chen96B, Shim96, Ghan96B, Tsao96, Chen96A] took the disk zoning feature into account to design video servers...
    • ...[Shim96] paired two identical disk drives together...
    • ...[Chen96A ]�proposed a scheme similar to the paring scheme proposed in [Shim96], except that the logical zone concept i s adopted...
    • ...This scheme inherits the same problem as that of [Shim96]...

    Sheau-Ru Tonget al. STUDY ON DISK ZONING FOR VIDEO SERVERS

    • ...[11]Paired two identical disk drives together, and enforced two disk heads to move in opposite directions synchronously to compensate for bandwidth differences by reading a pair of tracks, one from each disk drive, with a constant size in total...

    Sheau-ru Tonget al. Study on Disk Zoning for Video Servers

    • ...However, previous studies on storage servers did not fully exploite the properties of a NVOD system including the pre-determinate program schedule and the periodical broadcast of videos, and resulted in the waste of the disk bandwidth[ 1][2][4]...

    Shiao-Li Tsaoet al. An Efficient Storage Server For Near Video-on-demand Systems

Sort by: