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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received June 9, 1998 / Accepted January 21, 1999
Rights and permissions
About this article
Cite this article
Huang, YM., Ding, JW. & Tsao, SL. Constant time permutation: an efficient block allocation strategy for variable-bit-rate continuous media data. The VLDB Journal 8, 44–54 (1999). https://doi.org/10.1007/s007780050073
Issue Date:
DOI: https://doi.org/10.1007/s007780050073