Performance of a storage system for supporting different video types and qualities

Liu, J.C.L.; Hsieh, Jenwei; Du, David Hung-Chang; Lin, Mengjou

doi:10.1109/infcom.1996.497871

Cited by 9 publications

(17 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…in Refs. [1,3,6,7,11,15,17,19,21,22,30]). The most popular per-stream buffering implementation, Double Buffering, is based on the co-operation of two buffers of identical size allocated to each client.…”

Section: Scheduling Of Server Resourcesmentioning

confidence: 99%

Efficient memory management in video on demand servers

García-Martínez

Fernández-Conde

Vina

2000

Computer Communications

View full text Add to dashboard Cite

In this article we present, analyse and evaluate a new memory management technique for video-on-demand servers. Our proposal, Memory Reservation Per Storage Device (MRPSD), relies on the allocation of a fixed, small number of memory buffers per storage device. Selecting adequate scheduling algorithms, information storage strategies and admission control mechanisms, we demonstrate that MRPSD is suited for the deterministic service of variable bit rate streams to intolerant clients. MRPSD allows large memory savings compared to traditional memory management techniques, based on the allocation of a certain amount of memory per client served, without a significant performance penalty. ᭧

show abstract

Section: Scheduling Of Server Resourcesmentioning

confidence: 99%

Efficient memory management in video on demand servers

García-Martínez

Fernández-Conde

Vina

2000

Computer Communications

View full text Add to dashboard Cite

show abstract

“…A 90-min movie file in MPEG-II format occupies about 5 GB of storage and requires an I/O bandwidth of about 8 megabits per second (Mbps) 1 . Based on our experimental results, each RAID-3 can store at most three movie files and support at most 11 concurrent accesses if a reasonably sized buffer is dedicated to each stream [6,9]. In the above access profile, we want to support 44 concurrent viewers (i.e., accesses) to the movie title "Forest Gump".…”

Section: Introductionmentioning

confidence: 99%

“…This problem can be solved by replicating this movie file over four RAID-3s, striping it over five RAID-3s, or using a combination of replication and striping over some number of RAID-3s. We should point out that striping this movie title over four RAID-3s was not sufficient to support 44 concurrent accesses since there is a performance penalty in the disk striping [9]. The number of MPEG-II streams that can be supported by striping over four RAID-3s (four-way striping) is 36.…”

Section: Introductionmentioning

confidence: 99%

“…The number of MPEG-II streams that can be supported by striping over four RAID-3s (four-way striping) is 36. Table 2 shows the number of concurrent accesses that can be supported by different ways of striping over RAID-3s [9].…”

Section: Introductionmentioning

confidence: 99%

“…2 System architecture and assumptions 2.1 VOD system architecture and VOD service quality Figure 1 shows the architecture of a large-scale VOD server that is under development in the Distributed Multimedia Center at The University of Minnesota [6,9].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficient video file allocation schemes for video-on-demand services

Wang

Liu

et al. 1997

Multimedia Systems

View full text Add to dashboard Cite

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 different demands for different movie titles, the numbers of concurrent accesses to each movie can differ a lot. We define access profile as the number of concurrent accesses to each movie title that should be supported by a VOD server. The access profile is derived based on the popularity of each movie title and thus serves as a major design goal for the disk storage subsystem. Since some popular (hot) movie titles may be concurrently accessed by hundreds of users and a current high-end magnetic disk array (disk) can only support tens of concurrent accesses, it is necessary to replicate and/or stripe the hot movie files over multiple disk arrays. The consequence of replication and striping of hot movie titles is the potential increase on the required number of disk arrays. Therefore, how to replicate, stripe, and place the movie files over a minimum number of magnetic disk arrays such that a given access profile can be supported is an important problem. In this paper, we formulate the problem of the video file allocation over disk arrays, demonstrate that it is a NP-hard problem, and present some heuristic algorithms to find the near-optimal solutions. 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.

show abstract

A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem

Bektaş

Oğuz

Ouveysi

2007

European Journal of Operational Research

View full text Add to dashboard Cite

Video on demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, which is further characterized by optimally placing videos to a number of predefined servers and routing the user program requests to available resources. In this paper, an exact solution algorithm is described to solve the video placement and routing problem. The algorithm is based on Lagrangean relaxation and decomposition. The novelty of the approach can be described as the use of integer programs to obtain feasible solutions in the algorithm. Computational experimentation reveals that for randomly generated problems with up to 100 nodes and 250 videos, the use of such integer programs help greatly in obtaining good quality solutions (typically within 5% of the optimal solution), even in the very early iterations of the algorithm. © 2006 Elsevier B.V. All rights reserved

show abstract

Performance of a storage system for supporting different video types and qualities

Cited by 9 publications

References 5 publications

Efficient memory management in video on demand servers

Efficient memory management in video on demand servers

Efficient video file allocation schemes for video-on-demand services

A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem

Contact Info

Product

Resources

About