Conference Paper

Buffer management in multimedia database systems

Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY
DOI: 10.1109/MMCS.1996.534973 Conference: Multimedia Computing and Systems, 1996., Proceedings of the Third IEEE International Conference on
Source: IEEE Xplore

ABSTRACT Investigates the principles of buffer management for multimedia data presentations in object-oriented database environments. The primary goal is to minimize the response time of multimedia presentations while ensuring that all continuity and synchronization requirements are satisfied. Minimum buffering requirements to guarantee the continuity and synchrony of the presentation of multimedia data are proposed. These principles provide users with the full range of information required to develop a database environment for multimedia presentations

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In continuous media servers, disk load can be reduced by using buffer cache. In order to utilize the saved disk bandwidth by caching, a continuous media server must employ an admission control scheme to decide whether a new client can be admitted for service without violating the requirements of clients already being serviced. A scheme providing deterministic QoS guarantees in servers using caching has already been proposed. Since, however, deterministic admission control is based on the worst case assumption, it causes the wastage of the system resources. If we can exactly predict the future available disk bandwidth, both high disk utilization and hiccup-free service are achievable. However, as the caching effect is not analytically determined, it is difficult to predict the disk load without substantial computation overhead. In this paper, we propose a statistical admission control scheme for continuous media servers where caching is used to reduce disk load. This scheme improves disk utilization and allows more streams to be serviced while maintaining near-deterministic service. The scheme, called Shortsighted Prediction Admission Control (SPAC), combines exact prediction through on-line simulation and statistical estimation using a probabilistic model of future disk load in order to reduce computation overhead. It thereby exploits the variation in disk load induced by VBR-encoded objects and the decrease in client load by caching. Through trace-driven simulations, it is demonstrated that the scheme provides near-deterministic QoS and keeps disk utilization high.
    Multimedia Tools and Applications 02/2003; 19(3):279-296. DOI:10.1023/A:1023229414510 · 1.06 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Respond time and processing rate representing how many tasks can be done during an unit time in a client/server environment are generally use for measuring the performance of computers. In this paper, we suggest a window buffer managing scheme based on a window with many of short-term sliced slots where a media stream is allocated and deallocated into them so that it can maximize the utilization ration of the limited buffer on a multimedia server. And we also propose a buffer substitution scheme for reducing I/O times of a multimedia server by counting re-reference time point about a used block and then it can be reused by the next consecutive media stream.
    01/2005; 9(1).
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we investigate a playout scheduling framework for supporting the continuous and synchronized presentations of multimedia streams in a distributed multimedia presentation system. We assume a situation in which the server and network transmissions provide sufficient support for the delivery of media objects. In this context, major issues regarding the enforcement of the smooth presentation of multimedia streams at client sites must be addressed to deal with rate variance of stream presentations and delay variance of networks. We develop various playout-scheduling algorithms that are adaptable to quality-of-service parameters. The proposed algorithms permit the local adjustment of unsynchronized presentations by gradually accelerating or retarding presentation components, rather than abruptly skipping or pausing the presentation materials. A comprehensive experimental analysis of the proposed algorithms demonstrates that our algorithms can effectively avoid playout gaps (or hiccups) in the presentations. This scheduling framework can be readily used to support customized multimedia presentations.
    Multimedia Systems 06/1999; 7(4):312-325. DOI:10.1007/s005300050133 · 0.44 Impact Factor


Available from