Maximizing the profit for cache replacement in a transcoding proxy
Journal
IEEE International Conference on Multimedia and Expo, ICME 2005
Journal Volume
2005
Pages
1162-1165
Date Issued
2005
Author(s)
Hung, H.-P.
Abstract
Recent technology advances in multimedia communication have ushered in a new era of personal communication. Users can ubiquitously access the Internet via various mobile devices. For the moible devices featured with lower-bandwidth network connectivity, transcoding can be used to reduce the object size by lowering the quality of a mutimedia object. In this paper, we focus on the cache replacement policy in a transcoding proxy, which is a proxy server responsible for transcoding the object and reducing the network traffic. Based on the architecture in prior works, we propose a Maximum Profit Replacement algorithm, abbreviated as MPR. MPR performs cache replacement according to the content in the caching candidate set, which is generated by the concept of dynamic programming. Experimental results show that the the proposed MPR outperforms the prior scheme in terms of the cache hit ratio. © 2005 IEEE.
Subjects
Cache Replacement Policy; Transcoding Proxy
Other Subjects
Cache hit ratio; Cache replacement policy; Proxy server; Transcoding proxy; Algorithms; Dynamic programming; Internet; Mobile telecommunication systems; Network components; Personal communication systems; Telecommunication traffic; Multimedia systems
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
01521633.pdf
Size
243.54 KB
Format
Adobe PDF
Checksum
(MD5):b14d55175a1302c5768b9acdd5613ec7