Threshold-based dynamic replication in large-scale Video-on-Demand systems

被引:10
|
作者
Lie, PWK [1 ]
Lui, JCS [1 ]
Golubchik, L [1 ]
机构
[1] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Sha Tin 100083, Hong Kong
关键词
D O I
10.1109/RIDE.1998.658278
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Advances in high speed networking technologies and video compression techniques have made Video-on-Demand (VOD) services feasible. A large-scale VOD system imposes a large demand on bandwidth and storage resources, and therefore, parallel disks are typically used for providing VOD service. Although striping of movie data across a large number of disks can balance the utilization among these disks, such a striping technique can exhibit additional complexity, for instance, in data management, such as synchronization among disks during data delivery, as well as in supportingfault tolerant behavior. Therefore, it is more practical to limit the extent of data striping, for example, by arranging the disks in groups (or nodes) and then allowing intra-group (or intra-node) data striping only. With multiple striping groups, however, we may need to assign a movie to multiple nodes so as to satisfy the total demand of requests for that movie. Such an approach gives rise to several design issues, including:(1) what is the right number of copies of each movie we need so as to satisfy the demand and at the same time not waste storage capacity, (2) how to assign these movies to different nodes in the system, and (3) what are efficient approaches to altering the number of copies of each movie (and their placement) when the need for that arises. In this paper, we study an approach to dynamically reconfiguring the VOD system so as to alter the number of copies of each movie maintained on the server as the access demand for these movies fluctuates. We propose various approaches to addressing the above stated issues, which result in a VOD design that is adaptive to the changes in data access patterns. Performance evaluation is carried out to quantify the costs and the performance gains of these techniques.
引用
收藏
页码:52 / 59
页数:8
相关论文
共 50 条
  • [31] A replication strategy for reducing wait time in video-on-demand systems
    Chua, TS
    Goh, CH
    Ooi, BC
    Tan, KL
    MULTIMEDIA TOOLS AND APPLICATIONS, 2001, 15 (01) : 39 - 58
  • [32] Distributed Threshold-based Offloading for Large-Scale Mobile Cloud Computing
    Qin, Xudong
    Li, Bin
    Ying, Lei
    IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2021), 2021,
  • [33] A Replication Strategy for Reducing Wait Time in Video-On-Demand Systems
    Tat Seng Chua
    Cheng Hian Goh
    Beng Chin Ooi
    Kian-Lee Tan
    Multimedia Tools and Applications, 2001, 15 : 39 - 58
  • [34] Dynamic Buffer Management for Near Video-On-Demand Systems
    Wen-Jiin Tsai
    Suh-Yin Lee
    Multimedia Tools and Applications, 1998, 6 : 61 - 83
  • [35] Dynamic buffer management for near video-on-demand systems
    Tsai, WJ
    Lee, SY
    MULTIMEDIA TOOLS AND APPLICATIONS, 1998, 6 (01) : 61 - 83
  • [36] VOVO: VCR-Oriented Video-on-Demand in Large-Scale Peer-to-Peer Networks
    He, Yuan
    Liu, Yunhao
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2009, 20 (04) : 528 - 539
  • [37] Efficient Distributed Threshold-Based Offloading for Large-Scale Mobile Cloud Computing
    Qin, Xudong
    Li, Bin
    Ying, Lei
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2023, 31 (01) : 308 - 321
  • [38] USVoD: A Large Scale Video-on-Demand System Based on Uniform Sampling Cache Mechanism
    Ku, Chin-Fu
    Zheng, Yu-Fang
    Chen, Sao-Jie
    Ho, Jan-Ming
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2009, 25 (01) : 219 - 233
  • [39] A novel dynamic caching for hierarchically distributed video-on-demand systems
    Ogo, K
    Matsuda, C
    Nishimura, K
    MULITMEDIA NETWORKS: SECURITY, DISPLAYS, TERMINALS, AND GATEWAYS, 1998, 3228 : 135 - 146
  • [40] A DYNAMIC POLICY OF SEGMENT REPLICATION FOR LOAD-BALANCING IN VIDEO-ON-DEMAND SERVERS
    DAN, A
    KIENZLE, M
    SITARAM, D
    MULTIMEDIA SYSTEMS, 1995, 3 (03) : 93 - 103