Principles of delay-sensitive multimedia data storage retrieval

Abstract

This paper establishes some fundamental principles for the retrieval and storage of delay-sensitive multimedia data. Delay-sensitive data include digital audio, animations, and video. Retrieval of these data types from secondary storage has to satisfy certain time constraints in order to be acceptable to the user. The presentation is based on digital audio in order to provide intuition to the reader, although the results are applicable to all delay-sensitive data. A theoretical framework is developed for the real-time requirements of digital audio playback. We show how to describe these requirements in terms of the consumption rate of the audio data and the nature of the data-retrieval rate from secondary storage. Making use of this framework, bounds are derived for buffer space requirements for certain common retrieval scenarios. Storage placement strategies for multichannel synchronized data are then categorized and examined. The results presented in this paper are basic to any playback of delay-sensitive data and should assist the multimedia system designer in estimating hardware requirements and in evaluating possible design choices.

A Data Aware Admission Control Technique for Social Live Streams (SOLISs)

“…They do so by monitoring either the amount of available memory, disk [26,18,28,1] and network [2,8] bandwidth, or a combination of these resources. For example, admission control techniques developed for video-on-demand servers consider disk bandwidth in combination with the available memory to control how many simultaneous requests may stream data from the disk without overflowing memory [13,10,22,9,15,20]. Similarly, multi-layer encoding techniques are employed to control the bandwidth requirements of a stream in the presence of bursty background load that exhausts the available network bandwidth [21,24,27].…”

Providing resource allocation and performance isolation in a shared streaming-media hosting service

“…the continuous playback requirements should never be violated for the entire service duration. The corresponding algorithms are characterized by the worst case assumptions regarding the service time from disk [6,12,14,16,17,4]. In [15,8,1,7], statistical ac-algorithms are designed which provide probabilistic QoS guarantees instead of deterministic ones, resulting in higher resource utilization due to statistical multiplexing gain.…”

Embedded video in hypermedia documents

“…If more clients wanted to access server y than it could handle, or if the network were being saturated by competing requests for other video and non-video services, the environment might not be able to provide correctly synchronized video data. A common solution to this problem is the definition of an admission control protocol for network and server resources [10], [34], [35]. Admission control protocols are typically biased toward existing clients in the network.…”