Optimization of the grouped sweeping scheduling (GSS) with heterogeneous multimedia streams
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
Multimedia network file servers: multi-channel delay sensitive data retrieval
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
I/O issues in a multimedia system
Computer
Distributed schedule management in the Tiger video fileserver
Proceedings of the sixteenth ACM symposium on Operating systems principles
Cello: a disk scheduling framework for next generation operating systems
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Phoenix: a low-power fault-tolerant real-time network-attached storage device
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
SMDP: minimizing buffer requirements for continuous media servers
Multimedia Systems
A Low-Cost Storage Server for Movie on Demand Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Observing the effects of multi-zone disks
ATEC '97 Proceedings of the annual conference on USENIX Annual Technical Conference
Layered quality adaptation for Internet video streaming
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Cycle based disk scheduling approach is widely used to satisfy the timing constraints of the multimedia data retrieval. While cycle based disk scheduling for multimedia data retrieval provides effective way of exploiting the disk bandwidth, it is possible that ongoing streams get exposed to jitter when the cycle is extended due to commencement of new session. In this article, we present the novel idea of avoiding temporal insufficiency of data blocks, jitter, which occurs due to the commencement of new session. We propose that sufficient amount of data blocks be available on memory such that the ongoing session can survive the cycle extension. This technique is called "pre-buffering". We examine two different approaches in pre-buffering: (i) loads all required data blocks prior to starting retrieval and (ii) incrementally accumulates the data blocks in each cycle. We develop an elaborate model to determine the appropriate amount of data blocks necessary to survive the cycle extension and to compute startup latency involved in loading these data blocks. The simulation result shows that limiting the disk bandwidth utilization to 60% can greatly improve the startup latency as well as the buffer requirement for individual streams. The algorithm proposed in this work can be effectively incorporated into modern streaming server design.