Share Email Print
cover

Proceedings Paper

Optimal approximation method to characterize the resource trade-off functions for media servers
Author(s): Ray-I Chang
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We have proposed an algorithm to smooth the transmission of the pre-recorded VBR media stream. It takes O(n) time complexity, where n is large, this algorithm is not suitable for online resource management and admission control in media servers. To resolve this drawback, we have explored the optimal tradeoff among resources by an O(nlogn) algorithm. Based on the pre-computed resource tradeoff function, the resource management and admission control procedure is as simple as table hashing. However, this approach requires O(n) space to store and maintain the resource tradeoff function. In this paper, while giving some extra resources, a linear-time algorithm is proposed to approximate the resource tradeoff function by piecewise line segments. We can prove that the number of line segments in the obtained approximation function is minimized for the given extra resources. The proposed algorithm has been applied to approximate the bandwidth-buffer-tradeoff function of the real-world Star War movie. While an extra 0.1 Mbps bandwidth is given, the storage space required for the approximation function is over 2000 times smaller than that required for the original function. While an extra 10 KB buffer is given, the storage space for the approximation function is over 2200 over times smaller than that required for the original function. The proposed algorithm is really useful for resource management and admission control in real-world media servers.

Paper Details

Date Published: 24 August 1999
PDF: 10 pages
Proc. SPIE 3846, Multimedia Storage and Archiving Systems IV, (24 August 1999); doi: 10.1117/12.360442
Show Author Affiliations
Ray-I Chang, Institute of Information Science (Taiwan)


Published in SPIE Proceedings Vol. 3846:
Multimedia Storage and Archiving Systems IV
Sethuraman Panchanathan; Shih-Fu Chang; C.-C. Jay Kuo, Editor(s)

© SPIE. Terms of Use
Back to Top