Proceedings International Conference on Parallel Processing (2002)
Vancouver, B.C., Canada
Aug. 18, 2002 to Aug. 21, 2002
Xueyan Tang , Hong Kong University of Science and Technology
Fan Zhang , Hong Kong University of Science and Technology
Samuel T. Chanson , Hong Kong University of Science and Technology
Streaming media is expected to become one of the most popular types of web content in the future. Due to increasing variety of client devices and the range of access speeds to the Internet, multimedia contents may be required to be transcoded to match the client?s capability. With transcoding, both the network and the proxy CPU are potential bottlenecks for streaming media delivery. This paper discusses and compares various caching algorithms designed for transcoding proxies. In particular, we propose a new adaptive algorithm that dynamically selects an appropriate metric for adjusting the management policy. Experimental results show that the proposed algorithm significantly outperforms those that cache only untranscoded or only transcoded objects. Moreover, motivated by the characteristics of many video compression algorithms, we investigate partitioning a video object into sections based on frame type and handling them individually for proxy caching. It is found that partitioning improves performance when CPU power rather than network bandwidth is the limiting resource, particularly when the reference pattern is not highly skewed.
X. Tang, F. Zhang and S. T. Chanson, "Streaming Media Caching Algorithms for Transcoding Proxies," Proceedings International Conference on Parallel Processing(ICPP), Vancouver, B.C., Canada, 2002, pp. 287.