Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/36725
Citations
Scopus Web of ScienceĀ® Altmetric
?
?
Type: Journal article
Title: An effective cache replacement algorithm in transcoding-enabled proxies
Author: Li, K.
Shen, H.
Tajima, K.
Huang, L.
Citation: Journal of Supercomputing, 2006; 35(2):165-184
Publisher: Kluwer Academic Publ
Issue Date: 2006
ISSN: 0920-8542
1573-0484
Statement of
Responsibility: 
Keqiu Li, Hong Shen, Keishi Tajima and Liusheng Huang
Abstract: In this paper, we address the problem of cache replacement for transcoding proxy caching. Transcoding proxy is a proxy that has the functionality of transcoding a multimedia object into an appropriate format or resolution for each client. We first propose an effective cache replacement algorithm for transcoding proxy. In general, when a new object is to be cached, cache replacement algorithms evict some of the cached objects with the least profit to accommodate the new object. Our algorithm takes into account of the inter-relationships among different versions of the same multimedia object, and selects the versions to replace according to their aggregate profit which usually differs from simple summation of their individual profits as assumed in the existing algorithms. It also considers cache consistency, which is not considered in the existing algorithms. We then present a complexity analysis to show the efficiency of our algorithm. Finally, we give extensive simulation results to compare the performance of our algorithm with some existing algorithms. The results show that our algorithm outperforms others in terms of various performance metrics.
Keywords: transcoding
proxy caching
cache replacement
multimedia
World Wide Web
Description: The original publication is available at www.springerlink.com
DOI: 10.1007/s11227-006-2920-9
Published version: http://www.springerlink.com/content/8n624460h1121m73/
Appears in Collections:Aurora harvest 6
Computer Science publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.