Constant time permutation: an efficient block allocation strategy for variable-bit-rate continuous media data

  • Authors:

  • Yueh-Min Huang;Jen-Wen Ding;Shiao-Li Tsao

  • Affiliations:

  • Department of Engineering Science, National Cheng Kung University, Tainan, 701,Taiwan, R.O.C./ e-mail: raymond@mail.ncku.edu.tw, {logic, sltsao}@system.es.ncku.edu.tw;Department of Engineering Science, National Cheng Kung University, Tainan, 701,Taiwan, R.O.C./ e-mail: raymond@mail.ncku.edu.tw, {logic, sltsao}@system.es.ncku.edu.tw;Department of Engineering Science, National Cheng Kung University, Tainan, 701,Taiwan, R.O.C./ e-mail: raymond@mail.ncku.edu.tw, {logic, sltsao}@system.es.ncku.edu.tw

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

To provide high accessibility of continuous-media (CM) data, CM servers generally stripe data across multiple disks. Currently, the most widely used striping scheme for CM data is round-robin permutation (RRP). Unfortunately, when RRP is applied to variable-bit-rate (VBR) CM data, load imbalance across multiple disks occurs, thereby reducing overall system performance. In this paper, the performance of a VBR CM server with RRP is analyzed. In addition, we propose an efficient striping scheme called constant time permutation (CTP), which takes the VBR characteristic into account and obtains a more balanced load than RRP. Analytic models of both RRP and CTP are presented, and the models are verified via trace-driven simulations. Analysis and simulation results show that CTP can substantially increase the number of clients supported, though it might introduce a few seconds/minutes of initial delay.