Please use this identifier to cite or link to this item:
|Title:||A buffer-inventory-based dynamic scheduling algorithm for multimedia-on-demand servers||Authors:||Pan, H.
Multimedia capacity region
Quality of service
|Issue Date:||1998||Citation:||Pan, H.,Ngoh, L.H.,Lazar, A.A. (1998). A buffer-inventory-based dynamic scheduling algorithm for multimedia-on-demand servers. Multimedia Systems 6 (2) : 125-135. ScholarBank@NUS Repository.||Abstract:||We present a producer-consumer model of multimedia-on-demand (MOD) servers. The producer retrieves media data from a disk and places it into a set of buffers, while the consumer sends out the data in the buffers to the users. We develop for the producer a buffer-inventory-based dynamic scheduling (BIDS) algorithm that guarantees non-zero inventory and non-overflow of data in the buffers to meet the continuity requirement and no-loss of data for each media stream. The algorithm can deal with heterogeneous me dia streams as well as the transient circumstances upon service completions and arrivals of new requests. To smooth out the impact of bursty data of variable-bit-rate media streams and therefore increase the maximum admissible load of requests, we also introduce into the scheduling scheme a time-scale-dependent peak consumption rate and a virtual cycle time. Based on BIDS, an effective admission control mechanism can be easily established by checking two simple conditions respectively on the overall system load and buffer size. Our algorithm is very easy to implement. Experiments carried out with an actual disk system and real video stream data verify that it is more robust compared to static scheduling algorithms previously proposed in the literature, especially when handling variable-bit-rate media streams.||Source Title:||Multimedia Systems||URI:||http://scholarbank.nus.edu.sg/handle/10635/111123||ISSN:||09424962|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 14, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.