视频文件分配磁盘阵列视频点播

Yuewei Wang, Jonathan C. L. Liu, D. Du, J. Hsieh
{"title":"视频文件分配磁盘阵列视频点播","authors":"Yuewei Wang, Jonathan C. L. Liu, D. Du, J. Hsieh","doi":"10.1109/MMCS.1996.534969","DOIUrl":null,"url":null,"abstract":"A video-on-demand (VOD) server needs to store hundreds of movie titles and to support thousands of concurrent accesses. We define the 'access profile' as the number of concurrent accesses to each movie title that should be supported by a VOD server. A current high-end magnetic disk array can only support tens of MPEG-2 concurrent accesses, and it is necessary to replicate and/or stripe the hot movie files over multiple disk arrays. 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 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.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Video file allocation over disk arrays for video-on-demand\",\"authors\":\"Yuewei Wang, Jonathan C. L. Liu, D. Du, J. Hsieh\",\"doi\":\"10.1109/MMCS.1996.534969\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A video-on-demand (VOD) server needs to store hundreds of movie titles and to support thousands of concurrent accesses. We define the 'access profile' as the number of concurrent accesses to each movie title that should be supported by a VOD server. A current high-end magnetic disk array can only support tens of MPEG-2 concurrent accesses, and it is necessary to replicate and/or stripe the hot movie files over multiple disk arrays. 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 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.\",\"PeriodicalId\":371043,\"journal\":{\"name\":\"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMCS.1996.534969\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMCS.1996.534969","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

视频点播(VOD)服务器需要存储数百个电影标题,并支持数千个并发访问。我们将“访问配置文件”定义为VOD服务器应该支持的每个电影标题的并发访问数。当前的高端磁盘阵列只能支持数十个MPEG-2并发访问,并且需要在多个磁盘阵列上复制和/或分条热门电影文件。如何在最少数量的磁盘阵列上复制、分条和放置电影文件,从而支持给定的访问配置文件是一个重要的问题。本文提出并解决了这一问题。研究结果可应用于视频点播服务器存储子系统的设计,以经济地降低成本或使磁盘阵列的利用率最大化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Video file allocation over disk arrays for video-on-demand
A video-on-demand (VOD) server needs to store hundreds of movie titles and to support thousands of concurrent accesses. We define the 'access profile' as the number of concurrent accesses to each movie title that should be supported by a VOD server. A current high-end magnetic disk array can only support tens of MPEG-2 concurrent accesses, and it is necessary to replicate and/or stripe the hot movie files over multiple disk arrays. 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 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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信