Staggered striping in multimedia information systems
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Comparing random data allocation and data striping in multimedia servers
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Server-based smoothing of variable bit-rate streams
MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
Cost Analyses for VBR Video Servers
IEEE MultiMedia
Traffic Characteristics and Smoothness Criteria in VBR Video Traffic Smoothing
ICMCS '97 Proceedings of the 1997 International Conference on Multimedia Computing and Systems
Pipelined Disk Arrays for Digital Movie Retrieval
ICMCS '95 Proceedings of the International Conference on Multimedia Computing and Systems
Optimizing the Placement of Multimedia Objects on Disk Array
ICMCS '95 Proceedings of the International Conference on Multimedia Computing and Systems
Performance evaluation of smoothing algorithms for transmittingprerecorded variable-bit-rate video
IEEE Transactions on Multimedia
Video-on-demand over ATM: constant-rate transmission and transport
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Typical block placement schemes generally assume CTL (Constant Time Length) block size, one block read for each stream in a round, round-robin striping, and peak rate-based admission control. Traditional smoothing schemes for stored continuous media objects do not consider the block layout of the storage system. Hence, the combination of schemes from the two domains can introduce new challenges. In this paper, we present a server transmission delay problem that arises when traditional block placement and smoothing schemes are used at the same time in a continuous media server. To resolve the problem, we first present two simple straightforward solutions, Server-side Block Prefetching and Multiple Block Read, and then propose a new solution Smoothed Fetching. SF overcomes the defects of the other two schemes by exploiting a smoothing technique when retrieving blocks from disks and using a tight admission control algorithm. Simulation results show that SF achieves the best performance among the three solutions.